-
Updated
May 19, 2020 - Java
trie-data-structure
Here are 97 public repositories matching this topic...
Algorithm to find the longest matching prefix for a binary string using a binary trie
-
Updated
Dec 10, 2023 - Rust
Simple Trie Structure implementation in C++
-
Updated
Dec 30, 2023 - C++
Recursively implemented a Trie Data Structure to support various word manipulations including Autocomplete. A trie is a 26-ary tree where the root node represents an empty string “” and if the kth (k going from 0 to 25) subtree is not a null subtree, it represents a string that is the concatenation of the characters represented by the parent and…
-
Updated
Apr 29, 2021 - C++
Auto Completion using JS(Trie DS)
-
Updated
Jul 25, 2020 - JavaScript
Resolve a set of problems using appropriate design and most efficient algorithms
-
Updated
Dec 24, 2020 - Python
Leetcode solution
-
Updated
Sep 25, 2021 - C++
Search Engine implemented using Splay Trees and Trie Data Structures in C Programming Language
-
Updated
Aug 11, 2023 - C
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.
-
Updated
Jun 22, 2024 - Java
Solver for the word asssociation game ruzzle using Trie Data Structure and BFS algorithm in python
-
Updated
Feb 29, 2024 - Python
Algorithm and Data Structure Project (PoliMi, year 2022) - Wordle
-
Updated
Mar 2, 2024 - C
Typeahead Suggestion - Backend
-
Updated
May 19, 2022 - Go
Implementação da estrutura de dados árvore digital trie 🌳🌳.
-
Updated
Jun 21, 2018 - Java
A trie, also called digital tree or prefix tree, is a type of search tree, a tree data structure used for locating specific keys from within a set. These keys are most often strings, with links between nodes defined not by the entire key, but by individual characters. In order to access a key (to recover its value, change it, or remove it), the …
-
Updated
Dec 12, 2021 - C++
A Double-array trie structure
-
Updated
Dec 7, 2023 - TypeScript
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.
-
Updated
Mar 13, 2024 - Java
-
Updated
May 24, 2023 - Python
-
Updated
Jul 6, 2022 - JavaScript
The tree data structure is a versatile object ; This offering offers the Trie tree - And Binary tree - Data tree. Information can be save at nodes of the tree Trees can be Printed to Tree-view Control / Function Insert / Find Prefix / Find Word a Start Character is used and Stop Character is used. the Trie tree Can store Characters as nodes; Used f
-
Updated
May 2, 2021 - Visual Basic .NET
-
Updated
Oct 19, 2019 - Java
Improve this page
Add a description, image, and links to the trie-data-structure topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the trie-data-structure topic, visit your repo's landing page and select "manage topics."