二叉树程序可运行.doc

#include stdio.h #include malloc.h #include stdlib.h typedef int ELEMTYPE; struct node { ELEMTYPE element; struct node *next; }; struct node *head; struct node *tail; void init() { head=(struct node *)malloc(sizeof(struct node)); if (!head) exit(0); head-next=NULL; tail=head; } int isEmpty() { if (head==tail) return 1; else return 0; } int length() { struct node *p; int cnt=0; for (p=head-next;p!=NULL;p=p-next) cnt++; return cnt; } void append(ELEMTYPE item) {struct node *p; p=(struct node *)malloc(sizeof(struct node)); if (!p) exit(0); p-element=item; p-next=tail-next; tail-next=p; tail=p; } struct node *search(ELEMTYPE item) { struct node *p; p=head-next; while(p!=NULL) { if (p-element==item) return p; else p=p-next; } return NULL; } void traversal() { struct node *p; printf (list is :);p=head-next; for(p=head-next;p!=NULL;p=p-next) printf (%d　,p-element); printf (\n); } void invert() {struct node *p,*q,*k; p=head-next ;q=p-next ;k=q-next ; while(k) {q-next =p; p=q; q=k; k=q-next; } q-next=p; head-next-next=NULL; head-next =q; } /*void del_k(ELEMTYPE k) {struct node *p,*q;p=head-next; while(p!=NULL) {if(p-element==k) {q=head-next; while(q-next!=p) q=q-next; q-next=p-next; q=p; p=p-next; free(q);} else p=p-next;} }*/ void del_k(ELEMTYPE k) {struct node *p,*q;p=head-next; while(p!=NULL) {if(p-element==k) {q=head-next; while(q-next!=p) q=q-next; q-next=p-next; q=p; p=p-next; free(q);} else p=p-next;} } int main() { init(); append(1); append(2); append(3); append(4); append(5); append(2); del_k(2); traversal(); invert(); traversal(); del_k(3); traversal(); }