Log On

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).

Account Information

Username:

Password:

Remember me:

If you check this option you will be automatically logged in the next time you come back to this site. Your Username and password will not be remembered. If you want the Username and Password fields filled in automatically the next time you log in, please use your browser's "Remember login" feature.

Clarion Roadmap

Try the roadmap (beta)

Search ClarionMag

Advanced search

From the archives

Data Structures and Algorithms Part XII - Trie This

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.

Links

Download PDFs

Clarion Magazine has moved!