Write a C++ code to insert the following numbers in two Binary Search Trees. Insert numbers of first list in Binary Search Tree#1, and numbers of second list in Binary Search Tree#2. Do not insert both lists in a single Binary Search Tree.  List#1. 5, 78, 45, 23, 11, 89, 10, 78, 6, 99, 876, 5, 67, 13  List#2. 5, 89, 688, 52, 557, 953, 5, 7, 55, 35, 89, 99, 99, 6, 557, 89, 5, 99, 6, 2, 45, 12, 7, 6, 94, 93, 99, 67   After inserting numbers in Binary Search Trees. Write a function to print only those numbers that appear in List#1 and more than 2 times in List#2. For example, the number “5� appears in List#1 and 3 times in List#2. So your code should print “5� and similar other numbers.
Write a C++ code to insert the following numbers in two Binary Search Trees. Insert numbers of first list in Binary Search Tree#1, and numbers of second list in Binary Search Tree#2. Do not insert both lists in a single Binary Search Tree.
ÂÂ
List#1.
| 5, 78, 45, 23, 11, 89, 10, 78, 6, 99, 876, 5, 67, 13 |
ÂÂ
List#2.
| 5, 89, 688, 52, 557, 953, 5, 7, 55, 35, 89, 99, 99, 6, 557, 89, 5, 99, 6, 2, 45, 12, 7, 6, 94, 93, 99, 67 |
ÂÂ
ÂÂ
After inserting numbers in Binary Search Trees. Write a function to print only those numbers that appear in List#1 and more than 2 times in List#2.
For example, the number “5� appears in List#1 and 3 times in List#2. So your code should print “5� and similar other numbers
Tags: alwaysopen, assignmenthelpaustralia, assignmenthelpmelbourne, assignmenthelpsydney, assignmenthelpwebsites, london, londonstudent, melbourne, myassignmenthelp, plagiarismfreework, studentassignmenthelp