| Interface | Description |
|---|---|
| ListADT<E> |
CS367 ListADT
The official List of CS367.
|
| QueueADT<T> |
A First In First Out data structure.
|
| StackADT<T> |
A First In Last Out data structure that also
provides a method to return the stack in
reverse order.
|
| Class | Description |
|---|---|
| Ancestor |
The main program (class) for determining the
closest (lowest) common ancestor for a pair of researchers.
|
| GenealogyTree |
A general tree that is can be used to keep
track of parent child relationships between data.
|
| LinkedList<E> | |
| LinkedListIterator<T> |
The iterator implementation for LinkedList.
|
| Listnode<E> |
The internal node structure of
LinkedList. |
| Queue<T> | |
| Stack<T> | |
| TreeNode<T> |
Represents a single node in a General Tree
Each node has data and a list of children.
|
| Exception | Description |
|---|---|
| EmptyQueueException |
Custom exception type for empty queues
|