数据结构第5章 树.ppt

bithrtree search(bithrtree head,elemtype x) { bithrtree p;p=head->lchild; while(p->ltag==0&p!=head) p=p->lchild; while(p!=head & p->data!=x) p=Inpostnode(p; if(p==head){printf"此值不存在;return(0; } else r