Implement a balance tree method for the linked implementation using the brute force method described in Section 20.4 of your textbook.

Hint: Copy the elements into an ArrayList

using an in-order traversal. Recursively build a balanced tree using a binary partitioning.

I dont want to create any new classes. I want to add a method called balanceTree() which performs either a right or left shift to balance the tree. I already asked this question once and the answer was not what I was looking for.

The inOrder method is provided and needs to pass a BinaryTreeNode as a refernce and an ArrayUnorderedList reference. It looks like... " protected void inOrder(BinaryTreeNode root, ArrayUnorderedList tempList) ".