[教学设计]数据结构算法经典 -单循环链表.docVIP

数据结构算法经典 -单循环链表 # define null 0 typedef char ElemType; typedef struct Circular { ElemType data; struct LNode *next; }; setnull(struct Circular **p) { *p=null; } int length (struct Circular **p) { int n=0; struct Circular *q=*p; while (q!=null) { n++; q=q-next; } return(n); } ElemType get(struct Circular **p,int i) { int j=1; struct Circular *q=*p; while (jiq!=null) { q=q-next; j++; } if(q!=null) return(q-data); else printf(position parameter is incorrect!\n); } int locate(struct Circular **p,ElemType x) { int n=0; struct Circular *q=*p; whi