BinarySearchTree.java

public class BinarySearchTree extends LinkedBinaryTree {
/* readIn performs the following opearations:
 (1) reads from fileName word by word
 (2) for every new word found in fileName a new BTNode is created and added to T according
to the rules of BST insertion
(3) for every duplicate word wordCounter of the corresponding BTNode is incremented */
 public void readIn(String fileName) { }
/* maxSearchPath finds and returns the length of the longest search path in T */
 public int maxSearchPath() { }
/* printWordsSorted prints all distinct words found in fileName, in sorted order */
 public void printWordsSorted() { }
/* printTenMostCommonWords finds and prints ten most common words from fileName together
with their respective wordCounter-s */
 public void printTenMostCommonWords() { }
}