中序遍历线索二叉树的演示.pptVIP

2021/10/15 * 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; } 0 0 + 0 0 - 0 0 / 0 0 * 1 1 e 1 1 f 1 1 a 1 1 b 0 0 - 1 1 c 1 1 d 0 1 thrt 中序遍历线索二叉树 p a+b*c- 2021/10/15 * Status InorderTraverse_Thr(BiThrTreeT,Status(*visit)(TElemType)) { p=T–lchild; w