Ternary Search Trees

Brought to you by: jerry2yu

Last Update: 2013-04-24

Get an email when there's a new version of Ternary Search Trees

Ternary search tree stores keys in sorted order, which can be used as a symbol table.
Searching operation is lightning fast, it is reported comparable with hashing table in most cases, and substantially faster than hashing for unsuccessful searches.

Project Activity

See All Activity >

Follow Ternary Search Trees

Ternary Search Trees Web Site

Other Useful Business Software

Auth0 for AI Agents now in GA

Ready to implement AI with confidence (without sacrificing security)?

Connect your AI agents to apps and data more securely, give users control over the actions AI agents can perform and the data they can access, and enable human confirmation for critical agent actions.

Start building today

Rate This Project

User Reviews

Be the first to post a review of Ternary Search Trees!

Additional Project Details

Registered

2006-01-24

Report inappropriate content

Recommended Projects

dcfldd
An Enhanced version of gnu dd with features useful for forensics and security. Key features include on-the-fly hashing, status output and faster disk wiping.
Cuckoo hash map
Hash map with standard interface that implements cuckoo hashing in the form of template container.
smalt
A mapper for DNA sequencing reads
tunguska
Tunguska is a ternary computer emulator. The goal is to provide a relatively easy-to-use platform, reminiscent of an early PC, for people who want to experience and experiment with ternary computing hands-on.
RAPSearch2
Reduced Alphabet based Protein similarity Search