Data Structures and Libraries

This section shows the implementation of the most used data structures on competitions. On each sub-section you can find raw implementations and the use of the STL data structures.

Contents:

• Heaps
  • Binary Heap
  • Priority Queue (STL)
• Sets
  • Union-Find Disjoint Set
• Trees
  • Segment Tree
  • Fenwick Tree