Level 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

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

Right View of TreeGiven an array of unique elements, construct a Binary Search Tree and print the right-view of the tree. Right view of a Tree is the set of nodes visible when tree is viewed from right side.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.Constraints1 <= N <= 10000 <= ar[i] <= 10000Output FormatFor each test case, print the right-view of the Binary Search Tree, separated by newline.Sample input7 5 3 8 2 4 7 9Sample output5 8 9

Find preorder traversal of height balanced BSTGiven a sorted array. Convert it into a Height balanced Binary Search Tree (BST). Find the preorder traversal of height balanced BST. If there exist many such balanced BST consider the tree whose preorder is lexicographically smallest.Height balanced BST means a binary tree in which the depth of the left subtree and the right subtree of every node never differ by more than 1.Sample input25 1 4 5 7 8 12 14 15 19 20 22 25 26 27 28 29 33 34 37 40 41 42 43 47 48Sample outputoutput=26 12 5 1 4 7 8 19 14 15 22 20 25 37 2

Is Balanced TreeGiven an array of unique elements, construct a Binary Search Tree and check if its balanced. A tree is said to be balanced if for every node, the difference between the height of its child nodes is not greater than 1.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.Constraints1 <= N <= 10000 <= ar[i] <= 10000Output FormatFor each test case, print "Yes" if the Binary Search Tree is balanced, "No" otherwise, separated by newline.Sample input6 50 30 70 20 40 60Sample outputYes

Problem statementsGiven a binary tree, find its height.Input FormatA single line of input contains string s which contains the node of the tree in level order fashion.'N' in the string represents NULL node.A string 5 1 1 2 N N 2 reprsents the tree 5 / \ 1 1 / \ 2 2Similarly a string 1 2 N 3 N represents the tree 1 / 2 / 3Constraints1 <= Number of nodes <= 10^51 <= Data of a node <= 10^5Output FormatPrint the height of the tree.Sample Input2 N 1 3 NSample Output3