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
A ternary search trie implementation in TypeScript.
Implementation of Code Auto-Completion and Spell-Checking using Tries and Ternary Tries.
A Rust implementation of Ternary Search Trees, with no unsafe block
COIS 3020H - Data Structures and Algorithms II
A C++ template class to create and use ternary trees
An implementation of ternary tree for auto-completion
COMP20003 Algorithms and Data Structures 2017 Semester 2, Project 1: An Autocomplete program that uses Ternary Search Tree and written in C.
Ternary Search Tree data structure
Implemented text Auto-complete feature from scratch
A GUI based program for a pharmacy, to store and manipulate medicine data
Autocomplete using a ternary search tree
Tree structure implementations in golang
An STL-compatible header-only C++ container library
Ternary search tree implementation in OCaml
Ternary Search Tree (TST) data structure implementation in C++
VT Programming team lecture 2016.04.14
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."