头插法和尾插法建立单链表

include stdio h include stdlib h typedef struct List int data struct List next 指针域 List void HeadCreatList List L 头插法建立链表 List s L next NULL for int i 0 idata i s next L next 将 L 指向的地址赋值给 S L next s void TailCreatList List L 尾插法建立链表 List s r r L for int i 0 idata i r next s r s r next NULL void DisPlay List L List p L next while p NULL printf d p data p p next printf n int main List L1 L2 L1 struct List malloc sizeof struct List L2 struct List malloc sizeof struct List HeadCreatList L1 DisPlay L1 TailCreatList L2 DisPlay L2 头插法创建链表头插法创建链表 include include struct node int data struct node next 建立只含头结点的空链表 struct node create list struct node head NULL head struct node malloc sizeof struct node if NULL head printf memory out of use n return NULL head next NULL head data 0 return head 头插法建立链表 int insert form head struct node head int num struct node head t head next struct node new node NULL new node struct node malloc sizeof struct node if NULL new node printf memory out of use n return 1 将新结点插入到链表的最后 new node data num new node next head t head next new node return 0 打印链表 int show list struct node head struct node temp temp head next while temp printf d n temp data temp temp next return 0 按值删除结点 头结点不被删除 int delete node struct node head int data head t 保存要删除结点的上一个结点 struct node head t head struct node temp NULL if head NULL printf delete node from empty list n return 1 查找删除的结点的前一个结点 如果此处查找的是删除的结点 则需要另加一个指针保存删除结点的前一个指针 while NULL head t next if data head t next data break head t head t next 如果要删除的结点不存在 直接返回 if NULL head t next printf node not found n return 1 删除操作 temp head t next head t next head t next next free temp return 0 void main int argc char argv struct node head head create list if NULL head printf create list error n insert form head head 123 insert form head head 456 show list head printf delete once n delete node head 123 show list head printf delete second n delete node head 456 show list head delete node head 0 show list head 尾插法创建链表尾插法创建链表 include include struct Node int data struct Node next 建立只含头结点的空链表 struct Node create list struct Node head NULL head struct Node malloc sizeof struct Node if NULL head printf memory out of use n return NULL head next NULL head data 0 return head 尾插法建立链表 int insert form tail struct Node head int num struct Node temp head struct Node new node NULL new node struct Node malloc sizeof struct Node if NULL new node printf memory out of use n return 1 寻找尾结点 while temp next NULL temp temp next 将新结点插入到链表的最后 new node data num new node next NULL temp next new node return 0 打印链表 int show list struct Node head struct Node temp temp head next while temp printf d n temp data temp temp next return 0 void main int argc char arg