二叉树的结点的删除.docVIP

/* Note:Your choice is C IDE */ #include stdio.h typedef struct node { int data; struct node *lchild,*rchild; }BTree; BTree *btree; void CreateTree(int x) { BTree *p,*currentnode,*parentnode; p=(BTree *)malloc(sizeof(BTree)); p-data=x; p-lchild=p-rchild=NULL; if(btree==NULL) btree=p; else { currentnode=btree; while(currentnode!=NULL) { parentnode=currentnode; if(currentnode-datax) currentnode=currentnode-lchild; else currentnode=currentnode-rchild; } if(parentnode-datax) parentnode-lchild=p; else parentnode-rchild=p; } } void MidOrder(BTree *btree) { if(btree!=NULL) { MidOrder(btree-lchild); printf(%d ,btree-data); MidOrder(btree-rchild); } } BTree *parent; BTree *search(BTree *t,int x) { BTree *p; p=t; while(p!=NULL) { if(p-data==x) return p; else if(p-datax) { parent=p;p=p-lchild;} else { parent=p;p=p-rchild;} } return NULL; } void DeleteNode(int x) { BTree *current,*p1,*c1; current=btree; current=search(btree,x); if(current==NULL) { printf(Not found\n); return;} if(current-lchild==NULLcurrent-rchild==NULLcurrent==btree) { btree=NULL; free(current);return;} if(current-lchild==NULLcurrent-rchild==NULL) { if(parent-datax) { parent-lchild=NULL; free(current);return;} else { parent-rchild=NULL; free(current);return;} } if(current-lchild==NULLcurrent==btree) { btree=btree-rchild; free(current);return;} if(current-rchild==NULLcurrent==btree) { btree=btree-lchild;free(current);return;} if(current-rchild==NULL) { if(parent-datax) { parent-lchild=current-lchild;free(current);return;} else { parent-rchild=current-lchild;free(current);return;} } if(current-lchild==NULL) { if(parent-datax) { parent-lchild=current-rchild;free(current);return;} else { parent-rchild=current-rchild;free(current);return;} } p1=current; c1=current-lchild; while(c1-rchild!=NULL) { p1=c1; c1=c1-rchild; } current-data=c1-data; p1-rchild=c1-lch