Test Writing: Binary Tree Sum Right Child

Created By: Pranav Narayanan

/ Version: 2025.2.0

Write a method named sumRightChild. sumRightChild accepts a single BinaryTree<Int> and returns the sum of the values in every node that is a right child. You may need to write a private helper method to solve this problem.

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