[鏈表]帶頭結點的鏈表的創建、查找、插入、刪除

#include <stdio.h><stdlib.h> node* next;
} Node, ** createLinklist( i = ==== (PNode)malloc((Node));
     (!-->next = (i = ; i < length; i++= (PNode)malloc((Node));
         (!-->data = i*->next = (!pHeader->
            pHeader->next =->next ==* search(PNode pHeader, = pHeader-> i = (p && (i <= p->++ (p && (i == k)) 
 insert(PNode pHeader, PNode pNew, = (  ==== search(pHeader, k-
        pNew->next = p->->next =   deleteNode(PNode pHeader, = ( === pHeader->= search(pHeader, k- (p && p->
        PNode temp = p->->next = temp->  = pHeader->, p->= p->=(NULL !=== pH->, p-> main(= NULL;
    PNode pNew === createLinklist(= search(pHeader, , result->= (PNode)malloc( (!-->data = ->next =