数据结构-线索二叉树中找前驱和后继

ThreadNode* FirstNode(ThreadNode* p)
{
    while (p->ltag == 0) {
        p = p->lchild;
    }
    return p;
}
ThreadNode* NextNode(ThreadNode *p)
{
    if(p->rtag == 0)
    {
        return FirstNode(p->rchild);
    }else{
        return p->rchild;
    }
}
//线索二叉树中序遍历
void InOrder(ThreadNode *T)
{
    for (ThreadNode *p = FirstNode(T); p != NULL; p = NextNode(p)) {
        visit(p);
    }
}

一、中序线索二叉树找前驱后继