An efficient Ternary Search Tree and persistent database for LuaJIT
-
Updated
Jun 11, 2021 - Lua
An efficient Ternary Search Tree and persistent database for LuaJIT
Implementation of Code Auto-Completion and Spell-Checking using Tries and Ternary Tries.
A ternary search trie implementation in TypeScript.
COIS 3020H - Data Structures and Algorithms II
A Rust implementation of Ternary Search Trees, with no unsafe block
An implementation of ternary tree for auto-completion
A C++ template class to create and use ternary trees
Autocomplete using a ternary search tree
Tree structure implementations in golang
Implemented text Auto-complete feature from scratch
A GUI based program for a pharmacy, to store and manipulate medicine data
VT Programming team lecture 2016.04.14
A semi completed text predictor made as a data structure class project using ternary search trees.
Ternary search tree implementation in OCaml
Ternary Search Tree (TST) data structure implementation in C++
Web-based AI for Letterpress
A SpellChecker with Ternary Search Tree
Add a description, image, and links to the ternary-search-tree topic page so that developers can more easily learn about it.
To associate your repository with the ternary-search-tree topic, visit your repo's landing page and select "manage topics."