X

DAYS

:

HOUR

:

MINS

:

SEC

Copied to Clipboard
Inorder Successor in BST
Easy Accuracy: 39.66% Submissions: 41304 Points: 2

Given a BST, and a reference to a Node x in the BST. Find the Inorder Successor of the given node in the BST.

Example 1:

Input:
2
/   \
1     3
K(data of x) = 2
Output: 3
Explanation:
Inorder traversal : 1 2 3
Hence, inorder successor of 2 is 3.


Example 2:

Input:
20
/   \
8     22
/ \
4   12
/  \
10   14
K(data of x) = 8
Output: 10
Explanation:
Inorder traversal: 4 8 10 12 14 20 22
Hence, successor of 8 is 10.

inOrderSuccessor(). This function takes the root node and the reference node as argument and returns the node that is inOrder successor of the reference node. If there is no successor, return null value.

Expected Time Complexity: O(Height of the BST).
Expected Auxiliary Space: O(1).

Constraints:
1 <= N <= 1000, where N is number of nodes

We are replacing the old Disqus forum with the new Discussions section given below.