Binary Search Trees

Create two binary search tree of 7 integer elements introduced on console. Print both trees. For example: 7-5-8-10-3-4-2 will be 7 5 8 3 10 2 4 then find matches in both trees. (Same data on both of them ) and print how many data matches are there and where on the tree (for example: 2 elements matched: 4 and 5) the trees has to be printed with the memory addresses (pointers) on each one : 0x434 7 0x043 0x4854 5 NULL NULL 8 0x04382 0x0554 3 0x04345 NULL 10 NULL NULL 2 NULL NULL 4 NULL IT has to print 3 levels: Father and 3 levels of sons 9 6 10 4 8 2 7 ## Deliverables 1) Complete and fully-functional working program(s) in executable form as well as complete source code of all work done. 2) Deliverables must be in ready-to-run condition, as follows (depending on the nature of the deliverables): 3) All deliverables will be considered "work made for hire" under U.S. Copyright law. Buyer will receive exclusive and complete copyrights to all work purchased. (No GPL, GNU, 3rd party components, etc. unless all copyright ramifications are explained AND AGREED TO by the buyer on the site per the coder's Seller Legal Agreement). ## Platform Windows. C++. Ansi (DOS mode)