Networks and Algorithms Performance course work

Android app with efficient prefix search of cities using a Trie data structure, GSON for JSON parsing, and map integration.

Prefix tree with key frequencies in Go

Wolfram Language (aka Mathematica) paclet with functions for creation and manipulation of tries (prefix trees) with frequencies.

A very simple yet algorithmically smart notepad. It's a PoC for real world application of the algorithms

Implementations of AVL Tree, Prefix Tree, Fenwick Tree, Segment Tree

A keyboard application made in Java capable of predicting more than half a million English words.

A router for Node.js based on a prefix tree

This program uses the Trie data structure or the prefix tree to suggest strings based on input words and a search key.

Tree structure implementations in golang

Perl extension for a PrefixTree

Telephone Directory with prefix based search functionality (Using Trie data structure)

implementation of a trie (prefix tree) to add and search words by given prefix

ROUTER - refining my skills working with tree-like structures.

My code for some important data structure, algorithm and number theory

Explores the design of Huffman Prefix Trees in C++.

This project implements a Trie (prefix tree) data structure in C++ for efficient word storage and retrieval. It supports operations like inserting words, searching for exact words, checking if any words start with a given prefix, and displaying all words stored in the Trie.

This is a simple console-based implementation of a Dictionary in Trie Data Structure. I have used a dataset of about 130,000 words which contains the Word, its meaning and its part of speech. The dataset is available here as synonyms.csv.