## [leetcode]Implement Trie (Prefix Tree)

Implement Trie (Prefix Tree) Implement a trie with insert, search, and startsWith methods. Note: You may assume that all inputs are consist of lowercase letters a-z. Use TrieNode * child[26] to denote 26 possible successors. Use count to denote the number of words that end at current node. If count […]