GitHub / Sparsh2234 / Trie-Data-Structure-Program
Recursively implemented a Trie Data Structure to support various word manipulations including Autocomplete. A trie is a 26-ary tree where the root node represents an empty string “” and if the kth (k going from 0 to 25) subtree is not a null subtree, it represents a string that is the concatenation of the characters represented by the parent and the kth letter of the alphabet (where ‘a’ is the 0th letter).
JSON API: http://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Sparsh2234%2FTrie-Data-Structure-Program
PURL: pkg:github/Sparsh2234/Trie-Data-Structure-Program
Stars: 0
Forks: 0
Open issues: 0
License: None
Language: C++
Size: 324 KB
Dependencies parsed at: Pending
Created at: over 4 years ago
Updated at: about 2 years ago
Pushed at: over 4 years ago
Last synced at: about 2 years ago
Topics: c-plus-plus, depthfirstsearch, recursive-functions, trie-data-structure