Programming Homework Help. COMP 2313 North American University Data Structure Code & Binary Search Trees Project
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).
Please be sure you are using the assignment template. I attached in down here a sample.
public void printTree(Node root){ if(root != null){ printTree(root.getLeftChild()); System.out.println(root.toSting( )); printTree(root.getRightChild()); } }