Search trees and skip lists

Ordered dictionaries: binary search trees and their balanced variants (AVL, red-black, 2-3, B-trees, splay, treaps, weight-balanced, Cartesian, order-statistic) and skip lists, including their insertion and deletion procedures.

• 2–3 tree
• B-tree
• Binary search tree
• AVL tree
• Cartesian tree
• Order statistic tree
• Red–black tree
• Skip list
• Splay tree
• Treap
• Weight-balanced tree

The dependency explorer needs JavaScript and its graph data.

Download the complete graph data.