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 makePerfect that adds nodes until the binary tree is a perfect tree. A perfect binary tree is one where all leaves are at the same level. Another way of thinking of it is that you are adding dummy nodes to the tree until every path from the root to a leaf is the same length. A perfect tree’s shape is exactly triangular and every node has exactly two children, and all of the leaves are at the same level. Each new node you add to the tree store the value 0. For example, if a variable t refers to reference tree #2, then the call t.makePerfect( ); change the tree’s state to the following:

Reference Tree #2