Implementing a Binary Search Tree

• Implement a class for the tree containing a reference to the root node
• Implement a class for the nodes
  • A node contains two references (to left and right child nodes)
  • A node contains a data field
  • The data field has type Comparable, so that you can compare the values in order to place them in the correct position in the binary search tree