lab5q3
int key; TreeNode left, right;
public BinarySearchTree() { root = null; }
// In-order traversal public void inOrderTraversal() { inOrderTraversal(root); }
return root; }