Tag
radix-tree
- Jun 11, 2026 Immutable Sequences and Structural Sharing in Radix-Balanced Vectors How a fixed branching factor turns an array into a shallow tree whose updates copy one path, and what the size table and tail slot buy the index. data structures
- May 7, 2026 Radix Trees over Fixed-Width Integer Keys Indexing by bit fields instead of by bytes turns a trie into a fixed-height array of tables. Why integer radix trees need no rebalancing, how their height is computed, and where they lose to hash tables. data structures
- Jun 10, 2025 Path Compression and the Patricia Trie Single-child chains inflate a trie by one node per byte. Patricia compression stores only branching nodes plus a skip value, changing lookup, insertion, and deletion in specific ways. data structures