emory-courses / dsa-java

Data Structures and Algorithms in Java
https://emory.gitbook.io/dsa-java/
42 stars 55 forks source link

[QZ#5] traversing trie #133

Closed MimiOlayeye closed 3 years ago

MimiOlayeye commented 3 years ago

How can we ensure we reach every endstate in the trie? does this require recursion? and once an endstate is reached is there a more efficient way to return the word other than traversing back up the branch of the trie?