LinkedIn Interview Question

Problem using a Trie data structure to find all possible words occurring in a data set. Output should be a set containing all words that occur in data set.

Interview Answer

Anonymous

Oct 4, 2012

We can traverse the Trie in inorder storing the roots and printing them when we reach a leaf.