c++学习之单链表以及常用的操作

新学数据结构，上我写的代码。

#include <iostream>
#include <cstdlib>

using namespace std;

typedef int ElemType;

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

typedef Node* LinkList;

//数据域的输入
void input(ElemType* a)
{
    cout<<"please enter the date value of the current node: ";
    cin >> *a;
}

//尾插法，我觉得更加符合我的习惯。这里用*L是因为需要将创建的头指针返回到主函数中，所以用指针
void CreateLinkList(LinkList* L,int n,void input(ElemType*))
{
    cout<<"this is the tail-insert-proach..."<<endl;
    LinkList s;
    *L = new Node;
    LinkList p = *L;
    (*L)->next = NULL;
    for(;n>0;n--)
    {
        s = new Node;
        input(&s->data);
        s->next = NULL;
        p->next = s;
        p = s;
    }
    s->next = NULL;
}

//链表的销毁
void DestoryList(LinkList *L)
{
    cout<<"we are going to delete the linklist..."<<endl;
    LinkList q,p = *L;
    while(p != NULL)
    {
        q = p->next;
        delete p;
        p = q;
    }

    *L = NULL;
    cout<<"we have destoryed the linklist..."<<endl;
}

void visit(ElemType* data)
{
    cout<<"the data of current node is: "<<*data<<endl;
}

//链表的遍历，这里不需要将变化返回到主函数中，所以不需要用指针。
void ListTraverse(LinkList L,void visit(ElemType*))
{
    LinkList p = L;
    p = p->next;
    while(p != NULL)
    {
        visit(&p->data);
        p = p->next;
    }
}


//比较函数
bool compare(ElemType* a,ElemType* b)
{
    if(*a == *b)
        return true;
    else
        return false;
}

//在链表中查找元素e
void LocateElem(LinkList L,ElemType e,bool compare(ElemType*,ElemType*))
{
    int i = 0; //记录结点的位置
    LinkList p = L;
    p = p->next;
    i++;
    while(p!=NULL)
    {
        if(compare(&p->data,&e))
        {
            cout<<"we have found the element in "<<i<<" node"<<endl;
        }
        p = p->next;
        i++;
    }
}

//在链表中插入一个数字
int ListInsert(LinkList *L,int i,ElemType e)
{
    LinkList p = *L;
    while(p!=NULL && i>1) //找到第i-1个结点
    {
        p = p->next;
        i--;
    }
    if(p==NULL || i<1) return 0; //判断结点存在
    LinkList s = new Node;  //将结点插入
    s->data = e;
    s->next = p->next;
    p->next = s;
    return 1;
}

int ListDelete(LinkList *L,int i,ElemType *ep)
{
    LinkList p = *L;
    while(p!=NULL && i>1) //找到第i-1个结点
    {
        p = p->next;
        i--;
    }
    if(p==NULL || i<1) return 0;
    LinkList q = p->next;
    p->next = q->next;
    *ep = q->data;
    delete q;
    return 1;
}

int main()
{
    LinkList L; //头指针，指向创建的头结点。头结点的data为空，尾结点的next为NULL
    int n,ep;
    cout<<"please enter the number of needed nodes(except the head node)..."<<endl;
    cin>>n;
    CreateLinkList(&L,n,input);
    LocateElem(L,3,compare);
    ListInsert(&L,2,100);
    ListDelete(&L,2,&ep);
    cout<<"the delete data value is "<<ep<<endl;
    ListTraverse(L,visit);
    DestoryList(&L);
    return 0;
}

下面是程序运行的结果：