Inorder Successor - BST

inorder_bst.cpp

Node * inOrderSuccessor(Node *root, Node *x)
{
    if(root==NULL)
    return root;
    if(x->right)
    {
        Node* temp=x->right;
        while(temp->left!=NULL)
        temp=temp->left;
        return temp;
    }
    else
    {
        Node* successor=NULL;
        Node* ancestor=root;
        while(ancestor!=x)
        {
            if(x->data<ancestor->data)
            {
                successor=ancestor;
                ancestor=ancestor->left;
            }
            else
            {
                ancestor=ancestor->right;
            }
        }
        return successor;
    }
}