A Dictionary implementation using Binary Search Trees Program requirements and structure You should be able to do the following: Add dictionary entries Search for an entry Print the whole dictionary...

A Dictionary implementation using Binary Search Trees

Program requirements and structure

You should be able to do the following:

• 
  

  Add dictionary entries

  
  


• 
  

  Search for an entry

  
  


• 
  

  Print the whole dictionary

  
  

You will be using the .compareTo method from the String class in order to move through your tree.

Recursive method to print the tree in inorder traversal (you need little mods below code)

public void printTree(Node root){

if(root != null){

printTree(root.getLeftChild());

System.out.println(root.toSting( ));

printTree(root.getRightChild());

}

}