Test Writing: Binary Tree Combine Strings

Created By: Pranav Narayanan

/ Version: 2025.2.0

Create a public class TreeCombineStrings that provides a single class method named combineStrings. combineStrings accepts a single BinaryTree<String>. If the passed tree is null, throw an IllegalArgumentException. Otherwise, return the String represented by this tree.

For example, given the tree:

      "12"
     /    \
  "c"      "4"
     \
     "s"

You would return "cs124", by concatenating the left subtree "cs", the current node "12", and the right subtree "4". You may need to write a private helper method to solve this problem.

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