A fast and space efficient Radix tree in Java
Advance Data Structure Studies
Implementation of Code Auto-Completion and Spell-Checking using Tries and Ternary Tries.
Realization of the prefix tree
תירגולים ומימושים למבני נתונים ואלגוריתמים
This project provides service logic for managing contacts, including add, delete,prefix search etc with database support & Trie data structure implementation for these services without Database too.
A comprehensive DSA repository with optimized solutions in Java programming language covering algorithms, data structures, and coding interview preparation. 🚀📚
Word Auto Completion with Tries
This repository is a comprehensive Java resource covering essential data structures and algorithms. It provides practical insights for developers to enhance proficiency, including solutions to product-based company interview questions, facilitating effective interview preparation.
This project implements a 26-way Trie data structure to manipulate and manage strings efficiently.Then inserts all words to the trie from the given txt file.
SimpleTextEditor based on tree structure with java language
This repository is a comprehensive Java resource covering essential data structures and algorithms. It provides practical insights for developers to enhance proficiency, including solutions to product-based company interview questions, facilitating effective interview preparation.
Telephone Directory with prefix based search functionality (Using Trie data structure)
An implementation of autocomplete using a Trie data structure
Add a description, image, and links to the trie-data-structure topic page so that developers can more easily learn about it.
To associate your repository with the trie-data-structure topic, visit your repo's landing page and select "manage topics."