B C D E F G I K L M N P R S V W

B

BSTTest - class BSTTest.

A simple class for testing the binary search tree.

BSTTest() - Constructor for class BSTTest

BinarySearchTree - class BinarySearchTree.

The BinarySearchTree class maps keys to values (duplicated keys are not allowed).

BinarySearchTree(Comparator) - Constructor for class BinarySearchTree

Constructs a new empty binary search tree ordered by the the given comparator

BinarySearchTree.BSTEntry - class BinarySearchTree.BSTEntry.

An extension of Map.Entry in the java.util package used for exporting a list view, or an iterator of the contents of this tree.

BinarySearchTree.BSTNode - class BinarySearchTree.BSTNode.

Contains the data for each node in the BinarySearchTree as well as a set of functions that performs some important calculations on nodes to analyze and manipulate the tree structure.

C

changeValue(Object, Object) - Method in class BinarySearchTree

Associates a new value with an existing key in the tree.

changeValue(Object, Object) - Method in interface DictionaryADT

Associates a new value with an existing key in the Dictionary.

clone() - Method in class BinarySearchTree.BSTNode

Copy the current instance into a new BSTNode.

clone() - Method in class BinarySearchTree

Makes a copy of this tree.

cloneTree(BinarySearchTree.BSTNode) - Method in class BinarySearchTree

Recursively copy the tree rooted at otherRoot, returning a reference to the newly copied subtree.

comparator - Variable in class BinarySearchTree

The comparator used to order these key/value pairs.

countWords(BufferedReader) - Method in class WordCount

Count the words from the BufferedReader and add them to the frequency count in the backing DictionaryADT.

D

DictionaryADT - interface DictionaryADT.

E

equals(Object) - Method in class BinarySearchTree.BSTEntry

Tests equivalence of the keys in two BSTEntries according to the stored comparator.

F

find(Object) - Method in class BinarySearchTree

Finds the value associated with the given key in this BST.

find(Object) - Method in interface DictionaryADT

Finds the value associated with the given key in the Dictionary.

findNode(Object) - Method in class BinarySearchTree

Tries to finds the node associated with a given key.

G

getComparator() - Method in class BinarySearchTree

Returns the comparator used to order this Dictionary.

getComparator() - Method in interface DictionaryADT

Returns the comparator used to order this Dictionary.

getEntryList() - Method in class BinarySearchTree

Gets a List view of the data in the BST.

getEntryList() - Method in interface DictionaryADT

Gets a List view of the data in the Dictionary.

getKey() - Method in class BinarySearchTree.BSTEntry

returns the key represented this entry.

getSize() - Method in class BinarySearchTree

Retrieves the number of elements in the tree

getSize() - Method in interface DictionaryADT

Retrieves the number of elements in the Dictionary.

getValue() - Method in class BinarySearchTree.BSTEntry

returns the value represented this entry.

getWordFrequencyDictionary() - Method in class WordCount

Retrieves the word/frequency pairs as a Dictionary.

getWordFrequencyList() - Method in class WordCount

Gets a list of the word/frequency pairs in the dictionary.

I

insert(Object, Object) - Method in class BinarySearchTree

Inserts a new key/value pair into the BST.

insert(Object, Object) - Method in interface DictionaryADT

Inserts a new key/value pair into the Dictionary.

K

key - Variable in class BinarySearchTree.BSTNode

Reference to the key this Node represents

L

left - Variable in class BinarySearchTree.BSTNode

Reference to the node that is considered the left child of this node in the tree structure.

M

main(String[]) - Static method in class BSTTest

The main test program

main(String[]) - Static method in class WordCount

Unit test for the wordcount program

N

node - Variable in class BinarySearchTree.BSTEntry

The node represented by this BSTEntry;

numElements - Variable in class BinarySearchTree

The number of elements in the BST

P

parent - Variable in class BinarySearchTree.BSTNode

Reference to the node that is considered the parent of this node in the tree structure.

print(PrintWriter, String) - Method in class BinarySearchTree.BSTNode

Pretty-Print this node and its subtree.

print(PrintWriter) - Method in class BinarySearchTree

Pretty-print the tree for debugging purposes.

print(PrintWriter) - Method in interface DictionaryADT

Pretty-print the tree for debugging purposes (optional).

R

recursiveGetEntryList(ArrayList, BinarySearchTree.BSTNode) - Method in class BinarySearchTree

Recursively copies the key/value pairs in the tree into the list entries.

right - Variable in class BinarySearchTree.BSTNode

Reference to the node that is considered the right child of this node in the tree structure.

root - Variable in class BinarySearchTree

The root of the BST.

S

setValue(Object) - Method in class BinarySearchTree.BSTEntry

Changes the value in the key/value pair represented by this BSTEntry.

V

value - Variable in class BinarySearchTree.BSTNode

Reference to the value this Node represents

W

WordCount - class WordCount.

A class that counts the occurrances of individual words in different input streams.

WordCount(DictionaryADT) - Constructor for class WordCount

Construct a new WordCount Object backed by a DictionaryADT d.

B C D E F G I K L M N P R S V W