[prev] 60 [next]

Compressed Tries

Compressed tries …
  • have internal nodes of degree at least 2   (i.e. non-finishing nodes must have ≥ 2 children)
  • are obtained from standard tries by compressing "redundant" chains of nodes
Example:

[Diagram:Pic/compressed-trie.png]