Tag
tries
- Apr 8, 2026 Child Representation and the Branching Factor Problem in Tries A trie costs one child lookup per key byte, so the node layout decides memory and speed. Compares dense arrays, sorted and linked child lists, bitmaps with rank, and double-array layouts. data structures
- Aug 14, 2025 Longest-Prefix Match and the Structures That Implement It Why a routing table cannot be a hash map, how a binary trie answers the longest-prefix query, and what multibit tries and TCAM buy in exchange for memory. networking
- Apr 22, 2025 Marking Key Boundaries in a Trie A trie node must distinguish a prefix from a stored key. The terminal marker costs one bit, one child slot, or one pointer depending on layout, and each choice changes lookup and iteration. data structures
- Feb 24, 2025 Lexicographic Enumeration and Range Scans over a Trie A trie yields keys in sorted order without a sort step. How depth-first traversal, ordered child storage, and iterator state interact, and why range scans cost what they cost. data structures