Data Structures and Algorithms · Trees

Tries

A tree where each path from the root spells out a prefix, built for fast string lookup.

Also known as: prefix trees, digital trees.

Start a lesson on Tries

Learn first

• Binary trees: A hierarchical structure where each node has at most two children.

Related topics

• String matching algorithms: Finding all occurrences of a pattern inside a larger text faster than checking every position.
• Hash tables: Mapping keys to array slots via a hash function for near-constant-time lookup.