An open API service indexing awesome lists of open source software.

https://github.com/jdsherbert/trie

Simple Trie Structure implementation in C++
https://github.com/jdsherbert/trie

cpp trie trie-data-structure trie-structure tries

Last synced: 6 months ago
JSON representation

Simple Trie Structure implementation in C++

Awesome Lists containing this project

README

          

![image](https://github.com/JDSherbert/Trie-Implementation/assets/43964243/dcc1a5a0-4eb5-4da1-a2d5-aba91c1634c2)

# Trie Implementation


Stars Badge
Forks Badge
Watchers Badge
Issues Badge

-----------------------------------------------------------------------


License



-----------------------------------------------------------------------
## Overview

A Trie is a tree-like data structure used to store a dynamic set or associative array where the keys are usually strings. The term "trie" comes from the word "retrieval," and the structure is sometimes called a "prefix tree" because it can efficiently store and retrieve keys based on their prefixes.

-----------------------------------------------------------------------