请用C++语言写一个简单的链表实现
时间: 2023-06-16 20:06:00 浏览: 44
以下是一个简单的链表实现,包括节点定义、添加节点、删除节点和遍历节点的操作:
```c++
#include <iostream>
using namespace std;
// 链表节点定义
struct Node {
int data;
Node* next;
};
// 添加节点
void addNode(Node*& head, int data) {
Node* newNode = new Node;
newNode->data = data;
newNode->next = NULL;
if (head == NULL) {
head = newNode;
} else {
Node* temp = head;
while (temp->next != NULL) {
temp = temp->next;
}
temp->next = newNode;
}
}
// 删除节点
void deleteNode(Node*& head, int data) {
if (head == NULL) {
return;
}
if (head->data == data) {
Node* temp = head;
head = head->next;
delete temp;
} else {
Node* temp = head;
while (temp->next != NULL && temp->next->data != data) {
temp = temp->next;
}
if (temp->next != NULL) {
Node* temp2 = temp->next;
temp->next = temp2->next;
delete temp2;
}
}
}
// 遍历节点
void traverse(Node* head) {
Node* temp = head;
while (temp != NULL) {
cout << temp->data << " ";
temp = temp->next;
}
cout << endl;
}
int main() {
Node* head = NULL;
addNode(head, 1);
addNode(head, 2);
addNode(head, 3);
traverse(head);
deleteNode(head, 2);
traverse(head);
return 0;
}
```