JAVA

Q6. Using the BTNode class from Chapter 9, write a new static method of the BTNode class to meet the following specification. No recursion is needed.

public static void subswap(BTNode root) // Precondition: Root is the root reference of a binary tree. // Postcondition: If root is non-null, then the original left subtree below // this root has been moved and is now the right subtree, and the original // right subtree is now the left subtree. // Example original tree: Example new tree: // // Example original tree: Example new tree: // 1 1 // / \ / \ // 2 3 3 2 // / \ / \ //4 5 4 5

7. Redo the previous problem as a new non-static BTNode method.