Create a public class TreeSumRightChild that provides a single
class method named sumRightChild. sumRightChild accepts a single
BinaryTree<Integer>. If the passed tree is null, throw an
IllegalArgumentException. Otherwise, return the sum of the values in
every node that is a right child. You may need to write a private helper method
to solve this problem.
For reference, cs125.trees.BinaryTree has the following public properties:
You're challenge is to write tests for this problem described above.
Stuck? You may find these lessons helpful: