Data structures

Representations of collections with their invariants, operations and costs (worst-case and amortized), whether the structure is developed on its own or as an augmented variant; an algorithm that merely uses a structure goes to the field of the problem it solves.

• Search trees and skip lists
• Heaps and priority queues
• Hashing
• Lists, stacks, queues and dynamic arrays
• Range-query and spatial structures
• Tries, suffix structures and integer dictionaries
• Disjoint sets and dynamic trees

The dependency explorer needs JavaScript and its graph data.

Download the complete graph data.