Test Writing: Binary Tree Count Increasing

Created By: Pranav Narayanan

/ Version: 2025.2.0

Write a method named countIncreasing that accepts a single BinaryTree<Integer>? and counts the number of nodes in the tree that have at least one child node and whose child nodes all have values strictly greater than their parent's value. If the passed tree is null, return 0.

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