now.net

Crit-bit tree

Also known as PATRICIA trie, PATRICIA tree. This is the canonical page; those names redirect here.

PATRICIA (Morrison 1968) is the one-bit-decision radix trie; byte-level path-compressed tries are the separate Radix tree entry.

Pairings in the atlas

Rivals: other methods for the same problems

Where it sits

search-structures · Data Structures