Question 1, Chapter 19, Section 6:

Complete the implementation of a DecisionTree, introduced in Chapter 19. This will require completing a number of methods from the source code for this chapter, particularly for LinkedBinaryTree. Your initial test should be the BackPainAnalyzer output from Listing 19.6 on page 746. Show test cases for at least two other correct traversals. Develop and demonstrate another decision tree that is at least as complex.

Question 2, Chapter 20, Section 4:

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.