Concepts2
🗂️Data StructureIntermediate
Iterative Segment Tree
An iterative segment tree stores all leaves in tree[n..2n-1] and internal nodes in tree[1..n-1], enabling O(\log n) point updates and range queries without recursion.
#iterative segment tree#segment tree#non-recursive+12
🗂️Data StructureIntermediate
Trie (Prefix Tree)
A trie (prefix tree) stores strings or bit-sequences so that common prefixes share nodes, making operations depend on the key length L rather than the set size.
#trie#prefix tree#autocomplete+12