A desktop scrabble app featuring an AI player which always plays the highest possible scoring word each turn.

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

This is project of Trie data structure.That include functionality like add word , search particular word and enter short word and find next possible words. This project is console base project.

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

A directory of all the CS112 (Data Structures) Projects. BigInteger, Expression Evaluation, Facebook Friends & Tries.

Provides different Java implementations of tries (prefix trees)

This project simulates a Type ahead feature with an in memory database(using Redis) which is similar to google's auto suggestion feature when typing in a search command. It is a complete standalone project which consists of backend which implements Trie and prefixweb which is used to call backend logic using REST API. --

The classic word game as a single player desktop app.

Realization of the prefix tree

A versatile and user-friendly text editor built in Java using Swing. This editor offers a range of features, from basic file operations to advanced text formatting and real-time spell-checking.

Implementation of Trie along with replication of google like autosuggest

Minimal named-entity tagging system

Data Structures Java

Implementation DS in JAVA

Contoh implementasi tree dan tries

Spring Boot Trie Implementation

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