單鏈表的相關操作

 typedef              node* }node,*pnode;

 
            pnode pHead = (pnode)malloc(     pnode pCurrent =     pCurrent->next =     (NULL ==          printf(         exit(-      printf(     (scanf(,&data)==          pnode pnew = (pnode)malloc(         (NULL ==              printf(             exit(-          pnew->data =         pCurrent->next =         pnew->next =         pCurrent =       }

 
       pnode pCurrent = pHead->     printf(     (pCurrent !=       printf(,pCurrent->      pCurrent = pCurrent->      printf( }

 
 pNode insert(pNode pHead,  value,       pNode pre =      ( k = ; k < i;k++          pre = pre->      pNode pnew = (pNode)malloc(     pnew->data =     
               
     pnew->link = pre->     pre->link =      }

 pNode delete_list(pNode pHead,       pNode pre = NULL;
     pNode pcurrent = pHead->link;
      (pHead==                 (pcurrent->data != value&&pcurrent->link !=          pre =         pcurrent = pcurrent->      pre->link = pcurrent->link;
       }

       pNode pcurrent = pHead->     (pcurrent !=          count++         pcurrent = pcurrent->       }

       pNode i,k;
          (i = pHead->next;i != NULL;i = i->         (k = i->next;k != NULL;k = k->              (i->data > k->                  temp = i->                 i->data = k->                 k->data =        }

        F =     S = F->     T = S->     head->link =     (T!=          S->link =         F =         S =         T = T->      S->link =      }