Implement Trie (Prefix Tree) leetcode java

Implement a trie with insert, search, and startsWith methods. Java Solution 1 A trie node should contains the character, its children and the flag that marks if it is a leaf node. You can use the trie in the following diagram to walk though the Java solution. class TrieNode { char c; HashMap<Character, TrieNode> children … Read more