Skip to content
#

depthfirstsearch

Here are 10 public repositories matching this topic...

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…

  • Updated Apr 29, 2021
  • C++

Improve this page

Add a description, image, and links to the depthfirstsearch 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 depthfirstsearch topic, visit your repo's landing page and select "manage topics."

Learn more