Inorder Successor in BST

Statement

You are given the root node of a binary search tree and a specific node p. Your task is to return the inorder successor of this p node. If there is no inorder successor of the given node, return NULL.

Note: The inorder successor of p is the node with the smallest value greater than p.data in the binary search tree.

Constraints:

• The tree contains nodes in the range $[1,500]$.

• $-10^4 \leq$Node.data $\leq 10^4$

• All Nodes will have unique values.

• p should exist in the tree.

Example