單鏈表的基本操作

#include"iostream.h"

#include"stdio.h"

#include"string.h"

struct node;

node* create()  //

return head;}

node*  reverse(node* head)

delete head;

head = null;

return pstr;}

void print(node* head)

cout<

node* del(node*head, int num)

while(num != p1->date  && p1->next !=null)

if(p1->date == num)

else

delete p1;

p1 = null;

}else

if(p->date <= ptemp->date )

else

}else

return head;}

void main()

單鏈表基本操作

include include include include includeusing namespace std typedef struct node node,plinklist plinklist createfromhead node pstnode node malloc sizeof...

單鏈表基本操作

單鏈表的初始化，建立，插入，查詢，刪除。author wang yong date 2010.8.19 include include typedef int elemtype 定義結點型別 typedef struct node node,linkedlist 單鏈表的初始化 linkedlist...

單鏈表基本操作

include using namespace std define namelenth 20 define ok 0 define error 1 typedef struct flagnode node 生成結點 inline node newnode 銷毀化煉表 void destroylin...