3 docs tagged with "advance data structures"

Disjoint Set Union (Union-Find) is an efficient data structure to track the union of disjoint sets.

Fenwick Tree (Binary Indexed Tree) is a more space-efficient data structure for cumulative frequency tables.

Segment Trees are used for efficient range queries.