二叉树的应用举例实验报告(燕山大学)(8)

}

pre = p; InThreading(pre,p->rchild); }

Status InOrderThreading(BiThrTree &Thrt, BiThrTree &T) {

BiThrTree pre,p; Thrt->RTag=Thread; Thrt->rchild=Thrt; if(!T) Thrt->lchild=Thrt; Thrt->lchild=T; pre=Thrt; p=T; else{ InThreading(pre, p); pre->RTag = Thread;

pre->rchild = Thrt;

Thrt->rchild=pre; }

return OK;

}

void visit(TElemType e)

{

}

void InOrderTraverse_Thr(BiThrTree T, void (*call)(TElemType e)) {

} BiThrTree p; p = T->lchild; while (p->LTag!=Thread){ p=p->lchild; } while(p->RTag!=Thread||p->rchild!=T){ p=p->rchild; } cout<<p->data; cout<<e<<' '; visit(p->data );