()前序序列ABDEHCFG
()中序序列DHEBAFCG
()后序序列HEDBFGCA
()
()BiTree INORDERPRIOR(NX) //在中序线索二叉树上查找结点N的前驱结点X
{if(n>ltag==){X=N>lchild; return (X);}
else {p=N>lchild;
while (p>rtag==) p=p>rchild;
X=p;return(p);} }
[] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] []