Inorder Successor in BST
Submissions: 15413   Accuracy:

39.66%

  Difficulty: Easy   Marks: 2

Given a BST,  and a reference to a Node x the task is to find the Inorder Successor of the node . 

Input:
The first line of input contains an integer T denoting the no of test cases. Then T test cases follow.  The second line consist of an integer N. Then in the next line are N space separated values of the BST nodes. In the next line is an integer x representing the value of the node in the BST.

Output:
For each test case output will be the Inorder successor of the given node. If no such successor is present output will be -1.

Constraints:
1<=T<=100
1<=N<1100
1<=A[]<=1000

Example:
Input:

2
7
20 8 22 4 12 10 14
8
7
20 8 22 4 12 10 14
10
Output:
10
12

‚Äč
 

** For More Input/Output Examples Use 'Expected Output' option **

Contributor: Harshit Sidhwa,Saksham Raj Seth
Author: Shubham Joshi 1


If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.



Need help with your code? Please use ide.geeksforgeeks.org, generate link and share the link here.


to report an issue on this page.