Class Summary |
AATree<AnyType extends Comparable<? super AnyType>> |
Implements an AA-tree. |
ArrayQueue<AnyType> |
Array-based implementation of the queue. |
ArrayStack<AnyType> |
Array-based implementation of the stack. |
BinaryHeap<AnyType extends Comparable<? super AnyType>> |
Implements a binary heap. |
BinarySearchTree<AnyType extends Comparable<? super AnyType>> |
Implements an unbalanced binary search tree. |
BinarySearchTreeWithRank<AnyType extends Comparable<? super AnyType>> |
|
DisjointSets |
Disjoint set class, using union by rank
and path compression. |
DisjointSetsFast |
Disjoint set class, using union by rank
and path compression. |
Exiting |
|
LinkedList<AnyType> |
Linked list implementation of the list
using a header node. |
LinkedListIterator<AnyType> |
Linked list implementation of the list iterator
using a header node. |
ListQueue<AnyType> |
List-based implementation of the queue. |
ListStack<AnyType> |
List-based implementation of the stack. |
PairingHeap<AnyType extends Comparable<? super AnyType>> |
Implements a pairing heap. |
RedBlackTree<AnyType extends Comparable<? super AnyType>> |
Implements a red-black tree. |
SortedLinkedList<AnyType extends Comparable<? super AnyType>> |
Linked list implementation of the list
using a header node. |
SplayTree<AnyType extends Comparable<? super AnyType>> |
Implements a top-down splay tree. |