There are 3 repositories under trie topic.
A collection of powerful data structures
Static memory-efficient Trie-like structures for Python based on marisa-trie C++ library.
Python module (C extension and plain python) implementing Aho-Corasick algorithm
leetcode.com , algoexpert.io solutions in python and swift
Universal database layer for the client, server & mobile devices. It's like Lego for databases.
PruningRadixTrie - 1000x faster Radix trie for prefix search & auto-complete
Go datastructures.
.NET Implementations of Trie Data Structures for Substring Search, Auto-completion and Intelli-sense. Includes: patricia trie, suffix trie and a trie implementation using Ukkonen's algorithm.
The Capsule Hash Trie Collections Library
Algo-Tree is a collection of Algorithms and data structures which are fundamentals to efficient code and good software design. Creating and designing excellent algorithms is required for being an exemplary programmer. It contains solutions in various languages such as C++, Python and Java.
Project is in active development and has been moved to the EthereumJS VM monorepo.
Implementation of various Data Structures and algorithms - Linked List, Stacks, Queues, Binary Search Tree, AVL tree,Red Black Trees, Trie, Graph Algorithms, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Segment Trees etc.
This repo contains solutions to problem of data structures in c++
LeetCode solutions
Fast generic radix trie implemented in Rust
A lightweight high-performance and radix tree based router for Lua/LuaJIT/OpenResty https://github.com/vm-001/gateways-routing-benchmark
PATRICIA, Double Array, LOUDS Trie implementations for Java
A lightweight full text indexer for .NET
A collection of common algorithms and data structures implemented in Java.
Data Structures implemented in Java
Data-Structures using C++.
Ciri is an Ethereum implementation written in Ruby.