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 numbers of 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, 7, 55, 35, 89, 99, 99, 6, 557, 89, 5, 99, 2, 45, 12, 7, 6, 94,93, 99, 67 (a) After inserting numbers in both Binary Search Trees. Write a function to print only those numbers that appear either in List#1 or List#2 but not in other list. (b) For example, your code should print “78” because it appears in List#1 but not in List#2. Also you code should print “2” because it appears in List#2 but not
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 numbers of 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, 7, 55, 35, 89, 99, 99, 6, 557, 89, 5, 99, 2, 45, 12, 7, 6, 94,93, 99, 67
(a) After inserting numbers in both Binary Search Trees. Write a function to print
only those numbers that appear either in List#1 or List#2 but not in other list.
(b) For example, your code should print “78” because it appears in List#1 but not
in List#2. Also you code should print “2” because it appears in List#2 but not
in List#1.
Trending now
This is a popular solution!
Step by step
Solved in 4 steps with 1 images