#

efficient-searching

Here is 1 public repository matching this topic...

shinchancode / Trie-Data-structure

Trie is a tree-based data structure, which is used for efficient retrieval of a key in a large dataset of strings.

resume hashing string project trie binary-search-tree tree-structure spell-check search-algorithm spell-checker key-length trie-tree data-structures-and-algorithms trie-data-structure efficient-searching aarti-rathi open-to-contribution

Updated Nov 14, 2023
C++

Improve this page

Add a description, image, and links to the efficient-searching topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the efficient-searching topic, visit your repo's landing page and select "manage topics."