ll.cpp

数据结构中所有算法的实现

#include "d:\cpp\head.h"
typedef int ElemType;
typedef struct LNode{
  ElemType     	data;
  struct LNode	*next;
}LNode,*LinkList;

void CreateList_L(LinkList &L,int n){
  //Create a linklist with head Node
  LinkList p;
  L=(LinkList)malloc(sizeof(LNode));
  L->next=NULL;
  L->data=0;
  for(;n>0;n--){
    p=(LinkList)malloc(sizeof(LNode));
    printf("NO %d:",n);
    scanf("%d",&p->data);
    p->next=L->next;L->next=p;L->data++;
  }//for
}//CreateList_L

void visit(ElemType e){
  printf("%5d",e);
}
void ListTraverse(LinkList L,void (*visit)(ElemType e)){
  LNode *p;
  p=L->next;
  printf("\n");
  while(p){
    visit(p->data);
    p=p->next;
  }
  printf("\n");
}
Status ListDel(LinkList &L,int i,ElemType &e){
  LNode *q,*p=L;
  int j=0;
  while(p->next&&j<i-1){p=p->next;j++;}
  if(p->next==NULL||j>i-1) return ERROR;
  q=p->next;
  e=q->data;
  p->next=q->next;
  free(q);
  return OK;
}