Test Writing: Binary Tree Count Children Sum to Even

Created By: Geoffrey Challen

/ Version: 2020.11.0

Create a method named countChildSumToEven that accepts a single BinaryTree<Int>? and counts the number of nodes in the tree where the values of the two children sum to an even number. You should not count nodes that don't have at least one child. Keep in mind that not every node has a right or left child, so you'll need to check for null carefully. However, you can assume that all the values in the tree are Ints.

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 TestBinaryTreeCounter 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