ternary-search-tree

An efficient Ternary Search Tree and persistent database for LuaJIT

Ternary Search Tree - Prefix Searching

COIS 3020H - Data Structures and Algorithms II

Implementation of Code Auto-Completion and Spell-Checking using Tries and Ternary Tries.

A ternary search trie implementation in TypeScript.

A Rust implementation of Ternary Search Trees, with no unsafe block

Dicionário utilizando estrutura ternária TRIE.

An implementation of ternary tree for auto-completion

C++ terminal based autocomplete engine built from scratch using TST, MinHeap, LRU Cache, KMP & Graph - ranks suggestions by frequency + recency with snippet expansion and undo/redo. Pure DSA, no libraries.

Ternary Search Tree data structure

A C++ template class to create and use ternary trees

Search auto-completion and spelling-correction engine in C++, from scratch: TST prefix index, popularity ranking, Norvig-style corrector

VT Programming team lecture 2016.04.14

A semi completed text predictor made as a data structure class project using ternary search trees.

An STL-compatible header-only C++ container library

Implemented text Auto-complete feature from scratch

A GUI based program for a pharmacy, to store and manipulate medicine data

Ternary search tree implementation in OCaml