Binary Search Trees

BST-Based Dictionary. This dictionary maps from the characters in "THEQUICKBROWNFOXJUMPSOVERTHELAZYDOG" to the index of their last appearance in the string.

Part 1

Download the following files and complete the unfinished methods at the bottom of BSTDictionary.java. Each method must conform to the Javadoc comments and the provided implementation notes.

• Dictionary.java - Dictionary interface representing a simple dictionary/map ADT.
• BSTNode.java
• BSTDictionary.java - UNFINISHED BST class that implements the Dictionary interface.
• BSTDictionaryTest.java - Gradescope submission tests.
• BSTDictionaryTest.java - Gradescope submission tests.

Part 2

This part of the assignment involves building intuitions about the behavior of binary search trees by interacting with a tree that represents the index of a book. We're providing code that will read a text file and create a BSTDictionay object that maps each word in a file to an ArrayList containing all of the locations where that word appears.

We are providing the following two files:

• TextIndexer.java - Utility class for generating index trees.
• TreeAnalysis.java - UNFINISHED Starter file for your analysis code.

See Gradescope for detailed instructions.