Test Writing: BinaryTree Count Equal Children

Created By: Geoffrey Challen

/ Version: 2021.10.0

Create a public class BinaryTreeCounter that provides a single class method named countEqualChildren that accepts a single BinaryTree<?> and counts the number of nodes in the tree that have two children with equal values. Keep in mind that not every node has a right or left child, so you'll need to check for null carefully. (Or use try-catch!) However, you can assume that all the values in the tree are non-null.

For reference, cs125.trees.BinaryTree has the following public properties:

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 Java's assert method