Computer Science Binary Search Tree Implement Binary search Tree (BST) and perform the following operations a. Insert the keys 11,66, 6,9,40,28,5, 88,125,90 b. Print the keys in sorted order using suitable traversal method. C. Search for a key x and prints its address if it is present. d. Compute height of the BST e. Print successor/predecessor of a given key f. Delete the keys 40 and 88 one by one and print the tree in level order after each delete. Note: use only recursive functions for all the operations. Write the c code with proper comments.

Algorithm Design 1. In-order traversal a binary tree in two ways. 1) Use recursive method 2) Use iterative method

A Dictionary implementation using Binary Search Trees Program requirements and structure You should be able to do the following: Add dictionary entries Search for an entry Print the whole dictionary You will be using the .compareTo method from the String class in order to move through your tree. Recursive method to print the tree in inorder traversal (you need little mods below code) public void printTree(Node root){ if(root != null){ printTree(root.getLeftChild()); System.out.println(root.toSting( )); printTree(root.getRightChild()); } } Instructions: Please use CODE TEMPLATE!

Course: Data Structure and Algorithms Language: Java Topic: AVL Tree Kindly solve this question prperly step by step and complete. AVL Tree basics Draw the AVL tree after performing each of the following operations consecutively on an initially empty binary search tree: insert 8, insert 6, insert 12, insert 3, insert 10, insert 9, delete 12, delete 8, insert 7, insert 8. If you delete an item from an AVL tree and then insert it back into the tree, will you always get back the original AVL tree? Justify your answer.

print the even numbers followed by ödd oh Ex4) Given the file pointerlmofQueue.java then write a main method: to - add some elements into the queue, - reverse the queue contents, (Hint use an array) - print the queue contents.

2. Perform the traversals for the above tree: a. reverse postorder: b. preorder traversal: c. Give the array representation of the binary tree above.