The following exercises is a method to be added to the IntTree class from this chapter. Yo...

The following exercises is a method to be added to the IntTree class from this chapter. You may define additional private methods to implement your public method if necessary. Several problem descriptions refer to the following reference binary trees:

Write a method called inOrderList that returns a list containing the sequence of values obtained from an inorder traversal of your binary tree of integers. For example, if a variable t refers to reference tree #3, then the call t.inOrderList( ) should return the list [8, 3, 7, 2, 1]. If the tree is empty, your method should return an empty list.

Reference Tree #3