C++操作链表

#include <iostream>

using namespace std;

struct Node{
    int data;
    Node *next;
};

Node* InitNodeList(){
    Node *node=0;//定义一个空指针
    return node;
}

Node* addNode(Node *nodeList,Node *node)
{
    if(nodeList == 0)
    {
        nodeList=node;
    }else{
        nodeList->next = node;
    }
    node->next=0;
    
    return nodeList;
}

Node* delNode(Node *nodeList,int data)
{
    Node *p,*q;
    p = q = nodeList;

    if(nodeList == 0)
    {
        cout << "链表为空" << endl;
        return nodeList;
    }
    if(nodeList->data == data)
    {
        nodeList=p->next;
        delete p;
        cout << "deleted" << endl;
    }
    else
    {
        while((p->data!=data)&&(p->next!=0))
        {
            q=p;
            p=p->next;
        }
        if((p->data)==data)
        {
            q->next=p->next;
            delete p;
            cout << "deleted" << endl;
        }else
            cout << "don't find the node:" << data << endl;
    }
    return nodeList;
}

void printNodeList(Node *nodeList)
{
    Node *p=nodeList;
    for(;p;)
    {
        cout << p->data << " ";
        p=p->next;
    }
    cout << endl;
}

int main(void){
    Node *node=InitNodeList();

    Node *a=new Node;
    a->data = 1;
    Node *b = new Node;
    b->data = 2;
    
    node = addNode(node,a);
    node = addNode(node,b);
    
    printNodeList(node);

    node = delNode(node,2);
    printNodeList(node);

    return 0;
}