Patricia trie

E1357566 UNEXPLORED

A Patricia trie is a space-efficient variant of a trie data structure that compresses chains of single-child nodes to optimize storage and lookup of associative arrays, especially for string or binary keys.

All labels observed (1)

Label Occurrences
Patricia trie canonical 1

How this entity was disambiguated

Referenced by (1)

Full triples — surface form annotated when it differs from this entity's canonical label.

Merkle Patricia tree basedOn Patricia trie