# Data Structures Algorithms
All Data Structures Algorithms notes →1 — Sparse Table
O(1) range-minimum/maximum queries on a static array via O(n log n) precomputation.
2 — Treap
Randomized BST combining heap priorities with BST ordering for expected O(log n) balance without explicit rotation logic.
3 — Rope
Binary-tree-of-string-chunks structure for O(log n) concatenation/insertion on very large strings.
4 — B-Tree
Multi-way balanced tree minimizing disk reads, the structure behind most database indexes.
5 — B+ Tree
B-tree variant that pushes all values to leaf nodes with a linked list across them, optimized for range scans.
6 — Bloom Filter
Probabilistic set-membership structure with no false negatives and a tunable false-positive rate, trading certainty for O(1) space-efficient lookups.
7 — Count-Min Sketch
Probabilistic frequency-counting structure for approximate counts over massive streams in sublinear space.
8 — HyperLogLog
Probabilistic cardinality-estimation structure for counting distinct elements in a stream using near-constant space.