### Question:
BinaryTree { public void traversePreOrder(Node node) { if (node != null) { System.out.print(" " + node.value); traversePreOrder(node.left); traversePreOrder(node.right); } }  void add(int value); boolean isEmpty(); int getSize(); boolean containsNode(int value); void delete(int value); void traverseInOrder(Node node); void traversePreOrder(Node node); void traversePostOrder(Node node); void traverseLevelOrder();  }### Answer:
@Test public void givenABinaryTree_WhenTraversingPreOrder_ThenPrintValues() { BinaryTree bt = createBinaryTree(); bt.traversePreOrder(bt.root); }