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 countEvenBranches that returns the number of branch nodes in a binary tree that contain even numbers. A branch node has one or two children (i.e., it is not a leaf). For example, if a variable t refers to reference tree #2, then the call t.countEvenBranches( ) should return 3 because there are three branch nodes with even values (2, 8, and 6). Notice that leaf nodes with even values are not included (the nodes storing 0 and 4).

Reference Tree #2