Problem StatementImagine you are building a threaded binary search tree to store data from a sensor network. Each sensor node produces data points, and you want to organize this data efficiently for quick retrieval. For this task create a program to insert 'n' data points into the threaded binary tree. Input format :The first line of input is n, which is a non-negative integer.The second line of input is a series of non-negative integers (separated by spaces), up to n. The data points represent the elements to be inserted into the threaded binary search tree.Output format :The output should display the data points in the inserted order, separated by space

The first line contains an integer , the number of nodes in the tree.Next line contains space separated integer where th integer denotes node[i].data.

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

Problem StatementImplement an AVL tree data structure that accepts a series of integers as input and constructs the AVL tree. After inserting all the integers, perform an in-order traversal of the AVL tree and print the elements.Input format :The first line of input consists of the number of nodes in the AVL Tree, N.The second line of input consists of the nodes of the AVL Tree, separated by space.Output format :The output prints the in-order traversal of the constructed AVL Tree, separated by space.

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

Problem statementYou are given a binary tree having nodes in string format.The boundary nodes of a binary tree include the nodes from the left and right boundaries and the leaf nodes, each node considered once.Figure out the boundary nodes of this binary tree in an Anti-Clockwise direction starting from the root node.Input format :List of numbers in string formatOutput format :Boundary nodes of a given binary treeSample test cases :Input 1 :3 4 5 6 7 8 9 10Output 1 :3 4 6 10 7 8 9 5