You will create a class for Employeelnfo 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 Name James B W Bevis Romney Wordsworth Revis Jacara Clegg Forbes Kalin Tros Archibald Beechcroft Penthor Mul Bartlet Finchley Latham Bine Jeff Myrtlebank Employee ID Number 6702 1255 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.

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.

To copy a tree, traverse the tree using an ___ traversal and add each data item visited to the new tree. inorder postorder preorder reorder