Practice: Binary Tree Traversal

Take out a piece of paper. We’ll be programming on paper.

Problem 1

• Implement an in-order toString() method using a recursive in-order traversal helper method for a BinaryTree<E>.

public class BinaryTree<E> {
  private BinaryNode<E> root;
  private Comparator<E> c;

  public String toString() {
   // your code
  }
}

• Use a recursive helper method.

• What is the base case?

• How do we make the problem smaller?

• What is an in-order traversal of a binary tree?

Show me your code before you leave