c++不带表头结点的线性链表的实现.docVIP

#includeiostreamusing namespace std;struct Node{ int data; Node * next;}; class linklist{public: Node *head; linklist(){head=NULL;} ~linklist(); Node *GetElemPtr(int position); int Length(); bool linklist::Empty(); void Clear(); void traverse(); void getelme(int position,int e); void setelme(int position,int e); void Insert(int position,int e); void Delete(int position,int e);}; linklist::~linklist(){Clear(); delete head;}bool linklist::Empty(){return head==NULL;}Node * linklist::GetElemPtr(int position){ Node * tmpPtr=head; int curposition = 1; while(tmpPtr!=N