Problem of the day
For the given binary search tree and k = 3
The 3rd smallest node is highlighted in yellow colour.
The first line contains an integer 'T' which denotes the number of test cases or queries to be run. Then the test cases are as follows.
The first line of each test case contains an integer that denotes the ‘k’ as described in the problem statement.
The second line of each test case contains elements of the tree in the level order form. The line consists of values of nodes separated by a single space. In case a node is null, we take -1 in its place.
For example, the input for the tree depicted in the below image would be :
1
2 3
4 -1 5 6
-1 7 -1 -1 -1 -1
-1 -1
Level 1 :
The root node of the tree is 1
Level 2 :
Left child of 1 = 2
Right child of 1 = 3
Level 3 :
Left child of 2 = 4
Right child of 2 = null (-1)
Left child of 3 = 5
Right child of 3 = 6
Level 4 :
Left child of 4 = null (-1)
Right child of 4 = 7
Left child of 5 = null (-1)
Right child of 5 = null (-1)
Left child of 6 = null (-1)
Right child of 6 = null (-1)
Level 5 :
Left child of 7 = null (-1)
Right child of 7 = null (-1)
The first not-null node(of the previous level) is treated as the parent of the first two nodes of the current level. The second not-null node (of the previous level) is treated as the parent node for the next two nodes of the current level and so on.
The input ends when all nodes at the last level are null(-1).
The above format was just to provide clarity on how the input is formed for a given tree.
The sequence will be put together in a single line separated by a single space. Hence, for the above-depicted tree, the input will be given as:
1 2 3 4 -1 5 6 -1 7 -1 -1 -1 -1 -1 -1
Print an integer which denotes the K-th smallest node in the given binary search tree.
For each test case, print the output in a separate line.
You do not need to print anything; it has already been taken care of.
1 <= T <= 50
1 <= N <= 10000
1 <= K <= N
-10^8 <= data <= 10^8 and data != -1
Where ‘T’ is the number of test cases, and ‘N’ is the total number of nodes in the binary search tree, ‘K’ is the given integer and “data” is the value of the binary search tree node.
Time Limit: 1sec
3
3
10 5 15 4 7 14 16 -1 -1 -1 -1 -1 -1 -1 -1
1
2 1 3 -1 -1 -1 -1
2
4 -3 5 -1 -1 -1 -1
7
1
4
For the first test case,
The third-smallest node is 7.
For the second test case, the smallest node is 1.
For the third test case, the second-smallest node is 4.
2
2
-2 -4 1 -5 -1 -1 -1 -1 -1
3
10 8 11 -1 -1 -1 -1 -1 -1 -1 -1
-4
11
For the first test case, the second-smallest node is -4.
For the second test case, the third-smallest node is 11.