Trees

Tries and radix trees

Members: Free account

Intermediate · 25 minYou are hereRead

Tries

A trie stores words letter by letter down a tree, so words sharing a beginning share a path, and every word with a given prefix sits under one node.

Advanced · 25 minYou are hereRead

Radix trees

Merging each chain of single-child nodes into one edge labelled with a string shrinks a trie, so that every node either ends a word or branches.

Related topics

Where to go next.