Coordinate Hash Trie: A Trie Variant Balancing between Time, Space, and Simplicity
-
Updated
Mar 25, 2023 - C
Coordinate Hash Trie: A Trie Variant Balancing between Time, Space, and Simplicity
3rd sem Data Structures project to implement a real world dictionary using Trie data structure.
data structures (avl, tries, binary search) experimental project for CEID
Practical Works Algorithm and Data Structures II
A simple Trie implementation in C with and without Hashing (WIP)
The objective of the work is the implementation of a database for locating words in a set of files.
Add a description, image, and links to the trie-tree topic page so that developers can more easily learn about it.
To associate your repository with the trie-tree topic, visit your repo's landing page and select "manage topics."