1. Given the two binary trees below: 4 2 5 6 3 3 4 5 7 (14) (15) (16) 18) 17 (20) Write a method called swapSubtrees, which swaps all of the left and right subtrees in the above binary trees. Add this method to the class Binary Tree and create a program to test this method for these 2 trees. Show the original trees and the resulting trees. Note: To test your algorithm, first create a binary search tree. - Write a method called singleParent, which returns the number of nodes in a binary tree that have only one child for the 2 trees given in the above. Add this method to the class Binary Tree and create a program to test this method. Note: To test your algorithm, first create a binary search tree. 2. Start with an empty heap, and enter ten items with priorities 1 through 10. Draw the resulting heap. - Now remove three entries from the heap that you created in the above exercise. Draw the resulting heap.

In this problem, we need to create a method capable of calculating the distance  between the deepest node on the left to the deepest node on the right. However my code is struggling to even output my binary search tree, and I am not sure how to code the method. Can someone please explain how I could code this?/////////////////////////////////////////////////////////////////////////// // // Pro3105 // //      Write a program that creates a binary search tree of 15 to 30 //      random Capital Letters. // //      Define the tree width operation by writing the method that will //      calculate the distance from the deepest node of the left subtree //      to the deepest node of the right subtree. // //                           K //                  ......../ \.......................... //                 /                                     \ //                H                                       U //            .../ \.....                         ......./ \... //           /…

Don't skip

In java: binary tree Write a method called findTotalParents (, this method will find all the nodes that considered to be parents with any dependency and return the total number of parents. The public method shall not take any parameters, but the private method takes a BNode as a parameter, representing the current root.

You have an empty binary search tree. After that, you do the following sequence of insertions:20, 30, 10, 50, 40, 60. Draw the status of the binary search tree after the first 3 insertions, and at the endof all 6 insertions (you only need to show 2 trees).