Create a public class named BinaryTreeOddSum with a single class method named oddSum.
oddSum accepts a BinaryTree<Integer>, that is a BinaryTree containing Integer values.
Return the sum of all of the odd values in the tree.
As a reminder, value % 2 returns a non-zero value if value is odd.
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: