Binary Trees C++

Write your own version of a class template that will create a binary tree that can hold values of any data type. Then, design an EmployeeInfo class that holds the following employee information: Employee ID Number:an integer Employee Name:a string Next, use the template you designed to implements binary tree whose nodes hold an instance of the Employeelnfo class. The nodes should be sorted on the Employee ID number. Test the binary tree by inserting nodes with the following information. 102Uohn Williams 1057Bill Witherspoon 2487Jennifer Twain 3769Sophia Lancaster 1017Debbie Reece 1275George McMullen 1899Ashley Smith 4218 Josh Plemmons Your program should allow the user to enter an ID number, then search the tree for the number. If the number is found, it should display the employee's name. If the node is not found, it should display a message indicating so. The following is a small example of a subset of a run of this program