/**
 ******************************************************************************
 *                    HOMEWORK:  15-121
 ******************************************************************************
 *                    Text concordance program
 ******************************************************************************
 *
 * In this class you to
 *    1) parse the input file and
 *    2) create a BST of all words.
 *
 * Because words can occur multiple times in a document, you have
 * to be able to keep track of the locations and occurrences of all words.
 *
 * You do not store each word more than once in your tree.
 *
 *
 *
 * @author
 * @date
 *****************************************************************************/
 /*****************************************************************************

                         IMPLEMENT THIS CLASS

 *****************************************************************************/

import java.util.*;
import java.io.*;

public class Concordance
{

	public BSTConcordance<Word> buildTree(String input)
	{
		throw new RuntimeException ("You need to implement this method");
	}

	public BSTConcordance<Word> buildTree(String input, Comparator<Word> comparator)
	{
		throw new RuntimeException ("You need to implement this method");
	}

	public BSTConcordance<Word> buildTree(ArrayList<Word> list, Comparator<Word> comparator)
	{
		throw new RuntimeException ("You need to implement this method");
	}


	public ArrayList<Word> sortByAlpha(BSTConcordance<Word> tree)
	{
		throw new RuntimeException ("You need to implement this method");
	}

	public ArrayList<Word> sortByFrequency(BSTConcordance<Word> tree)
	{
		throw new RuntimeException ("You need to implement this method");
	}

	public ArrayList<Word> getHighestFrequency(BSTConcordance<Word> tree)
	{
		throw new RuntimeException ("You need to implement this method");
	}
}