Pair Sum in BST.
• The left subtree of a node contains only nodes with data less than the node’s data. • The right subtree of a node contains only nodes with data greater than the node’s data. • Both the left and right subtrees must also be binary search trees.
1. All the elements of the Binary Search Tree are unique. 2. You can’t use the same node value/element of BST twice.
The first line of input contains an integer ‘T’, which denotes the number of test cases. Then each test case follows. The first line of every test case contains elements of Binary Search Tree in the level order form. The input consists of values of nodes separated by a single space in a single line. In case, a node is null, we take -1 in its place. The second line of every test case contains a single integer ‘K’ which denotes the target value.
The input for the tree depicted in the below image would be :
20 10 35 5 15 30 42 -1 13 -1 -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
For each test case, print a single line containing “true” or “false”.
You don’t need to print the output, it has already been taken care of. Just implement the given function.
1 <= T <= 5 1 <= N <= 10 ^ 3 0 <= DATA <= 10 ^ 9 1 <= K <= 10 ^ 9 Where ‘DATA’ denotes the value of each node in the given tree and ‘N’ denotes the number of nodes in BST. Time limit: 1 sec
Kth Largest Element in BST
Two Sum IV - Input is a BST
Icarus and BSTCOUNT