Q4.5 查找它的“下一个”结点

Write an algorithm to find the ‘next’ node (i.e., in-order successor) of a given node in a binary search tree where each node has a link to its parent.

typedef struct Node
{
    int val;
    Node *left,*right,*parent;
}Node;

Node* GetSuccessor(Node* node)
{
    if(node->right)
    {    Node *t = node->right;
        while(t&&t->left)
            t = t->left;
        return t;
    }
    else
    {
        Node* p ;
        while(p= node->parent)
        {    if(p->left == node)
                break;
            node = p;
        }
        return p;
    }
}