Solution: Inorder Successor in BST
Solution: Inorder Successor in BST gives a binary search tree and an existing node p. Return the node with the smallest value greater than p's value, or NULL if p has no inorder successor.
We'll cover the following...
We'll cover the following...
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
pis the node with the smallest value greater thanp.datain the binary search tree.
Constraints:
The tree contains nodes in the range
...