Using c++. Try to make it as simple as you can

Read a list of names from a file. Insert the names into a binary search tree that is a little different from what we discussed in class. For this tree, the left side will contain the larger values and the right side will contain the smaller values. In essence, it is the exact opposite of a normal binary search tree Our tree will also be able to store duplicate names. Aside from a left and a right pointer for each node, we will have another pointer variable that will point to a linked list. Each node in the linked list will contain the additional duplicate name Once the nodes have been inserted, give the user a chance to search for a name. Display your search path as you are searching through the tree and indicate if the name was found. If the name is found and there are duplicates, indicate how many duplicates of the name exist in the tree Here is an example Given the following names in the file Dan Your tree would look like the following Dan, Phil, Angela, Ayesha, Kai, Zia, Troy, Troy, Troy, roy