You are using an outdated browser. Please update your browser for a better user experience.

Implement Trie Prefix Tree


Implement a trie with insert, search, and startsWith methods. You may assume that all inputs are consist of lowercase letters a-z. All inputs are guaranteed to be non-empty strings.


Trie trie = new Trie();

trie.insert("apple");"apple"); // returns true"app"); // returns false

trie.startsWith("app"); // returns true

trie.insert("app");"app"); // returns true

To Start: