Create a binary linked tree, and traverse the tree by using the recursive function. The structure of the tree is as follows: //check pic//  You should input the nodes in pre-order sequence. If a child of a node is NULL, input a space. Write the function of create binary tree, pre-order to print the nodes, in-order to print the nodes and post-order to print the nodes. Count the height of the tree.   Hints: Header file typedef char ElemType;   typedef struct node//define the type of binary tree node {                                       }BTnode;       Source file #include <stdio.h> #include <stdlib.h> #include "tree.h"   BTnode * createTree()//create the binary tree，return the root {             BTnode *tnode;// tnode is the root             char elem;                                ;//input the character                            //if the input is a space，set the pointer as NULL               Else// if the input is not a space，generate the binary node and create its left…

Insert the following key values one by one into an empty AVL tree. Restore tree as needed during the process. After the tree is built, show the post order traversal result in terms of the order of the key values visited. 30   45   65   55   50   52

Suppose you have a binary search tree with 100 nodes and you want to find the node with the maximum value. What is the time complexity of this operation?

Insert the following keys into an initially empty binary search tree: 22, 34, 7, 18, 28, 34, 65, 50, 6, 10, 19. Show the resulting BST after deleting its root and Print the keys using preorder and in-order traversals.

Write a splay tree implementation with recursive insert and lookup functions.Implement an AVL tree either iteratively or recursively where the height of eachnode is maintained. Run a test where trees are built from the same list of values.When you generate the list of values, duplicate values should be considered alookup. Write the data file with an L or an I followed by a value which indicateseither a lookup or insert operation should be performed. Generate an XML file inthe format used by the PlotData.py program to compare your performance results

The following Program in java implements a BST. The BST node (TNode) contains a data part as well as two links to its right and left children.  1. Draw (using paper and pen) the BST that results from the insertion of the values 60,30, 20, 80, 15, 70, 90, 10, 25, 33 (in this order). These values are used by the program 2. Traverse the tree using preorder, inorder and postorder algorithms (using paper and pen) 3. Write the program in c++, follow its steps, then compile and run. - Compare the results to what you obtained in (2) above. - Try different values  class TestBST{public static void main(String []args){int i;int x[] = {60,30, 20, 80, 15, 70, 90, 10, 25, 33};BST t = new BST();for (i=0; i < 10; i++){System.out.print(" Adding: "+x[i]+" to the BST ");t.insert(x[i]);}System.out.println("\nPreorder traversal result:");t.preorder(t.root);System.out.println("\nInorder traversal result:");t.inorder(t.root);System.out.println("\nPostorder traversal result:");t.postorder(t.root);}}class…

Create a binary linked tree, and traverse the tree by using the recursive function. The structure of the tree is as follow:   You should input the nodes in pre-order sequence. If a child of a node is NULL, input a space. Write the function of create binary tree, pre-order to print the nodes, in-order to print the nodes and post-order to print the nodes. Count the height of the tree.   Header file typedef char ElemType;   typedef struct node//define the type of binary tree node {                                       }BTnode;       Source file #include <stdio.h> #include <stdlib.h> #include "tree.h"   BTnode * createTree()//create the binary tree，return the root {             BTnode *tnode;// tnode is the root             char elem;                                ;//input the character                            //if the input is a space，set the pointer as NULL               Else// if the input is not a space，generate the binary node and create its left sub-tree and right…

True/False   In a BST, smaller keys go to the right and larger keys to the left.     The smallest key in the tree is all the way to the left, while the largest key is all the way to the right.     Removal needs to be careful not to disconnect the tree.     Leaves can be removed directly, nodes with one child can be replaced with their parent, and nodes with two children use their "successor" which is the smallest item in their right subtree.

When inorder traversing a complete binary tree resulted E A C K F H D; the postorder traversal would return Select one: a.E C A F H D K b.E C A F D H K c.E A C F D H K d.E C F A D H K