Please enter your username and your password. (Note: If you registered on or after May 19, 2010 your email address is your username.)
If you've forgotten your password or your username, click here.
Don't have a login? Register now! It only takes a moment, and it's free (although most articles do required a paid subscription).
From the archives
12/4/2002 12:00:00 AM
In this article Alison Neal introduces a data structure known as the Trie, which is basically a type of general tree, containing words rather than numbers. The Trie is an immensely useful data structure when storing strings in memory. The Trie has been used for such things as computerized Boggle and Yahtzee games, and file compression algorithms.