My implementation of a simple trie structure using lists for data storage

Prefix Trie data structure with Pattern Matching, in C++

DataBase Management Project based on Näive & Advanced Searching Techniques

Trie Data structure and its Variants

Contoh implementasi tree dan tries

System Programming. Implementation of Search Engine using a Trie structure

Golang Advanced Data Structures

low-level, primitive autocomplete using trie data structure

C# implementation of a ternary search trie.

C# Concurrent Trie implementation - a port from Roman Levenstein Java based concurrent trie

An implementation of the wordBreak problem to split into all possible combinations of words that the original sentence could have been made up of. Takes the input from a file and outputs it to shell.

This is a TrieSort or Flowers Sort named after Watson Flowers. It is linear with how many elements are there.

An efficient way to search a contact's name from a contact list.An advanced data structure called 'TRIE' is used to optimize the time complexity.

The classic word game as a single player desktop app.

Create and modify trie prefix structures and extract word lists including prefixes, anagrams and sub-anagrams

A Java Library that uses Trie structure to retrieve a K most recurring words

A ternary search tree implementation in Go.

TRIE구조와 Tabular Parsing을 이용해 구현한 한국어 형태소 분석기입니다.

Data Structures Java

Implementation of a simple trie data structure, capable of storing strings of lowercase characters.