1.)Write a function, swapSubTrees, that swaps all of the left and right subtrees of a binary tree.
2.) write a method singleParent, that returns the number of nodes in a binary tree that have only one child.
Add these functions to the class binaryTree and create a program to test this function.