Deck · IOI — Competitive Programming
Trees & Range Data Structures
Advanced tree-based and range query data structures from the IOI syllabus: BSTs and balanced BSTs, Fenwick trees, segment trees (lazy, iterative), sparse tables, disjoint set union, treaps, heavy-light decomposition, Euler tours, LCA via binary lifting, Mo's algorithm, and sqrt decomposition. Emphasis on time/space complexity and when to use each.
82 cards · audited · SM-2 spaced repetition
Included with the full IOI — Competitive Programming program — 14 decks, 964 cards.
Sample cards
What is a binary search tree (BST)?
What are the core BST operations and their time complexity?
How do you delete a node with two children from a BST?
Why do we need balanced binary search trees?
What invariant does an AVL tree maintain, and what does it guarantee?
Showing 5 of 82 cards. Unlock the program to study them all.
More in IOI — Competitive Programming
Master trees & range data structures — and the rest of IOI — Competitive Programming.
One program. 964 audited cards across 14 decks.