计算机软件及应用中序遍历线索二叉树演示.pptxVIP

Status InorderTraverse_Thr(BiThrTreeT,Status(*visit)(TElemType)) { p=T–lchild; while(p!=T) { while(p –LTag = =Link) p=p –lchild; if(!visit(p –data)) return error; while(p –RTag = =Threadp –rchild!=T) { p=p –rchild; visit(p –data); } p= p–rchild; } return OK; };Status InorderTraverse_Thr(BiThrTreeT,Status(*visit)(TElemType)) { p=T–lchild; while(p!=T) { while(p –LTag = =Link) p=p –lchild; if(!visit(p –data)) return error; while(p –RTag = =Threadp –rchild!=T) { p=p –rchild; visit(p –data); } p= p–rchild; } return OK; };Status InorderTraverse_Thr(BiThrTreeT,Status(*visit)(TElemType)) { p=T–lchild; while(p!=T) { while(p –LTag = =Link) p=p –lchild; if(!visit(p –data)) return error; while(p –RTag = =Threadp –rchild!=T) { p=p –rchild; visit(p –data); } p= p–rchild; } return OK; };Status InorderTraverse_Thr(BiThrTreeT,Status(*visit)(TElemType)) { p=T–lchild; while(p!=T) { while(p –LTag = =Link) p=p –lchild; if(!visit(p –data)) return error; while(p –RTag = =Threadp –rchild!=T) { p=p –rchild; visit(p –data); } p= p–rchild; } return OK; };Status InorderTraverse_Thr(BiThrTreeT,Status(*visit)(TElemType)) { p=T–lchild; while(p!=T) { while(p –LTag = =Link) p=p –lchild; if(!visit(p –data)) return error; while(p –RTag = =Threadp –rchild!=T) { p=p –rchild; visit(p –data); } p= p–rchild; } return OK; };Status InorderTraverse_Thr(BiThrTreeT,Status(*visit)(TElemTy