Click here to Skip to main content
11,568,522 members (47,684 online)
Click here to Skip to main content
Add your own
alternative version

Ternary Search Tree Dictionary in C#: Faster String Dictionary!

, 27 Jan 2004 233.5K 3.7K 121
A TST is a fast and memory efficient data structure for implementing a string dictionary.

Revisions


  

Compare Revision Minor Date Status Editor
1 - publicly available No 28-Jan-04 0:00 Available Chris Maunder

License

This article has no explicit license attached to it but may contain usage terms in the article text or the download files themselves. If in doubt please contact the author via the discussion board below.

A list of licenses authors might use can be found here

Share

About the Author

Jonathan de Halleux
Engineer
United States United States
Jonathan de Halleux is Civil Engineer in Applied Mathematics. He finished his PhD in 2004 in the rainy country of Belgium. After 2 years in the Common Language Runtime (i.e. .net), he is now working at Microsoft Research on Pex (http://research.microsoft.com/pex).

You may also be interested in...

| Advertise | Privacy | Terms of Use | Mobile
Web03 | 2.8.150624.2 | Last Updated 28 Jan 2004
Article Copyright 2004 by Jonathan de Halleux
Everything else Copyright © CodeProject, 1999-2015
Layout: fixed | fluid