Write a method named sumRightChild. sumRightChild accepts a single
BinaryTree<Int> and returns 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 is defined like this:
Stuck? You may find these lessons helpful: