| Class | Description |
|---|---|
| AVLTree | |
| BinaryHeap | |
| BinarySearchTree | |
| BinarySearchTree.BinaryNode | |
| BTree | |
| DisjointSet<T> | |
| DoubleLinkedList<T> | |
| DoubleLinkedList.Node<T> | |
| FibonacciHeap | |
| Graph |
Conventions: the nodes are labeled from 0 to n (exclusive)
|
| Graph.Edge | |
| Graph.Node | |
| LinkedList<T> | |
| LinkedList.Node<T> | |
| MaxHeap | |
| MinHeap | |
| Pair<F,S> | |
| Queue<T> |
FIFO
|
| RedBlackTree |
A red-black tree is a binary tree that satisfies the following red-black properties:
1) Every node is either red or black
2) The root is black
3) Every leaf (NULL) is black
4) If a node is red, then both its children are black
5) For each node, all simple paths from the node to descendant leaves contain the same number of black nodes
|
| RedBlackTree.Node | |
| SegmentTree | |
| Stack<T> |
LIFO
|
| Trie |