Instructions. c++  binary search trees. 1. Implement a function that will build a binary search tree. 2. Using the function below create a binary search tree. 3. Implement a swapSubtrees() function that will take a pointer to a root node and a target value. Function will search for the target value in the tree and swap all left nodes with right nodes for all descendant  nodes. 4. Pass the tree created in step 2 to test swapSubtrees() function.

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.

IN C LANGUAGE When inserting a node into a linked list, where (in memory) will that node be placed if there is no overflow?                                                                                                                                    A) The location of the AVAIL pointer B) The next contiguous spot of memory from the last node C) The very end of the contiguous memory block D) A randomized memory location

C++ please  Please complete Programming Exercise 4, from pages 1402, from chapter 19 from your textbook.  Write a function, singleParent, that returns the number of nodes in abinary tree that have only one child. Add this function to the classbinaryTreeType and create a program to test this function. (Note: Firstcreate a binary search tree.)