Binary Trees (C++) You will create a class for Employeclnfo that contains: • Employee ID Number – int • Employee Name – string Implement a binary tree whose nodes hold an instance of your Employeelnfo class. The nodes should be sorted on the Employee ID number. You will have a binary tree class header and implementation file. You can write your main to use the following information to test your tree: Employee ID Number 6702 1255 Employee Name James B W Bevis Romney Wordsworth Revis Jacara Clegg Forbes Kalin Tros Archibald Beechcroft Penthor Mul Bartlet Finchley Latham Bine |Jeff Myrtlebank 1071 2390 1558 7406 7562 3004 4922 8483 Your program should read an employee ID and display a message telling the user whether it was found in the tree or not. Your main will have one binary tree object and all of the operations on the binary tree will be class methods. Other functions to add • Add function to display the tree • Allow user to add a new employee • Allow user to remove an employee NOTE – The “NEVER" list of rules: • You will NEVER use break, exit, returm, pass, continue or anything to leave a loop (or iteration), function, or other construct prematurely, unless it is part of the structure as in a case statement. • You will NEVER have a function call itself, unless it is intentional recursion. • You will NEVER use global variables. However, you may use global constants if it is appropriate and they are used properly. You will have only one return statement in a function. (Exception – Multiple return statements may be necessary in a recursive function.|

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.

AVL Tree Implementation program  Important note: You must separate your program into three files: header file (*.h), implementation file (*.cpp) and main file (*.cpp).   Write a program to build an AVL tree by accepting the integers input from users.  For each input, balance the tree and display it on the screen; you then calculate the indorder traversals as well.  There should be a menu to drive the program.  It should be similar as follows:                          AVL Tree Implementation        A: Insert an integer to tree and show the balanced tree at each insertion.        B: Display the balanced tree and show inorder traversal.        C: Exit To be sure, your program is correctly working, use the following data to test AVL tree: 15, 18, 10, 7, 57, 6, 13, 12, 9, 65, 19, 16, 23 You should perform more test with different data sets.

12:34 A cs61a.org Implement add_d_leaves, a function that takes in a Tree instance t and a number v. We define the depth of a node in t to be the number of edges from the root to that node. The depth of root is therefore 0. For each node in the tree, you should add d leaves to it, where d is the depth of the node. Every added leaf should have a label of v. If the node at this depth has existing branches, you should add these leaves to the end of that list of branches. For example, you should be adding 1 leaf with label v to each node at depth 1, 2 leaves to each node at depth 2, and so on. Here is an example of a tree t (shown on the left) and the result after add_d_leaves is applied with v as 5. 3 2 3 2 4 4 5 5 5 Hint: Use a helper function to keep track of the depth! def add_d_leaves(t, v): """Add d leaves containing v to each ng