算法设计-双向线索链表的二叉树中序遍历

注：详细概念请看数据结构->五、树

status InOrderTraverse_Thr(BiThrTree T,visit()){

            p=T->lchild;

            while(p!=T){

                while(p->LTag==Link) p=p->lchild;

                visit(p->data);

                while(p->RTag==Thread&&p->rchild!=T){p=p->rchild;visit(p->data);}//while

                p=p->rchild;

            }//while

            return Ok;

}//InOrderTraverse_Thr