Data Structures and Algorithms
Tries

A trie is a special form of n-ary tree which can efficiently store strings. There is one child node for every common prefix string. It is particularly suited for dictionary-style applications.

Animation

The authors of this algorithm were too shy to insert their names into the source code! If you are one of the authors - or know the authors - please email me so that this page can be updated with appropriate credits!
Trie Animation
This animation was written by
Students in CS at UWA

It is a prototype: volunteers to improve it are welcome!

Key terms

Tries

Continue on to Hash Tables Back to the Table of Contents
© John Morris, 2004