Test Writing: BinaryTree Odd Sum

Created By: Geoffrey Challen

/ Version: 2021.4.0

Create a method named oddSum that accepts a BinaryTree<Int>?, that is a BinaryTree containing Int values. Return the sum of all 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 is defined like this:

Test Design Challenge

You're challenge is to write tests for this problem described above.

• Provide a public class named TestBinaryTreeOddSum with a single non-private class method named test that accepts no arguments and does not return a value.
• If the implementation of the class described above is incorrect, your test method should throw an exception.
• If it is correct, do not throw an exception.
• You may want to use Kotlin's assert or check methods