trie

kpol

Trie (a.k.a. prefix tree) C# implementation. Has constant-time string prefix lookup.

c-sharp algorithm

View on GitHub

107 Stars

20 Forks

107 Watchers

C# Language

mit License

Cost to Build

$129.4K

Market Value

$329.6K

How is this calculated?

Growth over time

9 data points · 2021-03-01 → 2025-08-01

Stars Forks Watchers

💬

How do you feel about this project?

Ask AI about trie

Question copied to clipboard

What is the kpol/trie GitHub project? Description: "Trie (a.k.a. prefix tree) C# implementation. Has constant-time string prefix lookup.". Written in C#. Explain what it does, its main use cases, key features, and who would benefit from using it.

Question is copied to clipboard — paste it after the AI opens.

How to clone trie

Clone via HTTPS

git clone https://github.com/kpol/trie.git

Clone via SSH

[email protected]:kpol/trie.git

Download ZIP

Download master.zip

Found an issue?

Report bugs or request features on the trie issue tracker:

Open GitHub Issues

Similar to trie

javascript-algorithms CS-Notes interviews tech-interview-handbook interactive-coding-challenges algorithms algorithm-visualizer cosmos WaveFunctionCollapse JCSprout Python LeetCode javascript-algorithms awesome-java-leetcode turf awesome-competitive-programming AlgoWiki algorithms Learn-Algorithms PythonRobotics illustrated-algorithms machine_learning_basics EKAlgorithms algorithms_and_data_structures java-algorithms-implementation LeetCode-Swift leet-code ngraph.path C-Sharp-Algorithms Lean