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

Secure File Transfer for Windows with Cerberus by Redwood

Protect and share files over FTP/S, SFTP, HTTPS and SCP with the #1 rated Windows file transfer server.

Cerberus supports unlimited users and connections on a single IP, with built-in encryption, 2FA, and a browser-based web client — all deployable in under 15 minutes with a 25-day free trial.

Try for Free

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

Build Agents and Models on One Platform

Everything you need to build production-ready agents and models. Access 200+ Google and third-party AI models and tools.

Gemini Enterprise Agent Platform is Google Cloud's comprehensive platform for developers to build, scale, govern, and optimize agents and models. Choose from Google's most advanced models and third-party models like Anthropic's Claude Model Family.

Try It Free

Recommended Projects

sgrep (sorted grep)
Sgrep (sorted grep) is a much faster alternative to traditional Unix grep when searching large files, because sgrep searches sorted input files using a fast binary search to find matching lines.
ssdeep
Recursive computing and matching of Context Triggered Piecewise Hashing (aka Fuzzy Hashing). Supports Windows, *nix, BSD, OS X, etc.
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.
Java VoiceXML Editor
Free Open Source VoiceXML editor programmed in Java (Swing). The VoiceXML document is regularly parsed, a tree view is built and syntax errors are reported in a specific table.
Binary Search Tree
It is a C# library that implementes most binary tree algorithms such as insertion algorithm, deletion algorithms, and searching a node in a binary search tree. It also can conduct the preorder and postorder traversal functions.