Ternary Search Trie- Finding all the Strings
Hello, I'm trying to implement a TST where each node contains a character and I mark certain nodes as the end of a word. If I want to find all the words in the TST, how would I approach it? Should I use recursion? Thank you!
Topic archived. No new replies allowed.