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 evenLevels that makes sure that all branches end on an even level. If a leaf node is on an odd level it should be removed from the tree. We will define the root as being on level 1 . For example, if a variable t refers to reference tree #2, then the call t.evenLevels( ); should change the tree’s state to the following, removing the leaf value 0 because it is on an odd level:

Reference Tree #2