Question1Max. score: 10.00Find a highest sumGiven a binary tree in which each node element contains a number. Find the maximum possible path sum from one special node to another special node.Note: Here speci

Find a highest sumGiven a binary tree in which each node element contains a number. Find the maximum possible path sum from one special node to another special node.Note: Here special node is a node that is connected to exactly one different node.Constraints:2  ≤  Number of nodes  ≤  104-103  ≤ Value of each node ≤ 103Sample input3 4 5 -10 4Sample output16

Question7Max. score: 30.00Find the vertical sum in a given binary tree.You are given the root of a binary tree A.You have to find the vertical sum of the tree.A vertical sum denotes an array of sum of the different verticals of a binary tree,where the leftmost vertical sum is the first element of the array and rightmost vertical is the last.Sample input71 2 3 5 6 7 8Sample output9 6 11 6

Question3Max. score: 100.00Level Order of TreeGiven an array of unique elements, construct a Binary Search Tree and print the Level Order of the tree.Input FormatFirst line of each test case contains N - number of nodes in the BST. The next line contains N unique integers - value of the nodes.ConstraintsPrint the Level Order of the Binary Search Tree, separate each level by newline.Output Format1 <= N <= 10000 <= ar[i] <= 10000Sample input6 10 5 15 2 7 12Sample output10 5 15 2 7 12

Question4Max. score: 100.00Find Minimum and Maximum Values of BSTFind Minimum and MaximumWrite a relevant code snippet to print the maximum and minimum values of  the  binary search tree Sample Input40 20 60 10 30 50 70 5 15 25 35 45 55 65 75 -1 Sample Output:Minimum is : 5Maximum is : 75Sample input40 20 60 10 30 50 70 5 15 25 35 45 55 65 75 -1Sample output

Where is the maximum number in a binary search tree? a) At the root of the tree. b) Anywhere other than root and leaf nodes c) At the leftmost leaf node. d) At the rightmost leaf node