208. 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.

class TrieNode {
    boolean isWord = false;
    // String val = "";
    TrieNode[] children;
    // Initialize your data structure here.
    public TrieNode() {
        children =  new TrieNode[26];
    }
    // public TrieNode(String str) {
    //     this.val = str;
    // }
}

public class Trie {
    private TrieNode root;

    public Trie() {
        root = new TrieNode();
    }

    // Inserts a word into the trie.
    public void insert(String word) {
        TrieNode p = root;
        for(int i=0; i<word.length(); i++){
            char c = word.charAt(i);
            if(p.children[c-'a']==null){
                p.children[c-'a'] = new TrieNode();
            }
            p = p.children[c-'a'];
        }
        //a new word can be insearted into an internal node(already created node), this can not be inside the if{}
        p.isWord = true;
    }

    // Returns if the word is in the trie.
    public boolean search(String word) {
        TrieNode p = root;
        for(int i=0; i<word.length(); i++){
            char c = word.charAt(i);
            if(p.children[c-'a']==null){
                return false;
            }
            p = p.children[c-'a'];
        }
        return p.isWord;
    }

    // Returns if there is any word in the trie
    // that starts with the given prefix.
    public boolean startsWith(String prefix) {
        TrieNode p = root;
        for(int i=0; i<prefix.length(); i++){
            if(p.children[prefix.charAt(i)-'a']==null){
                return false;
            }
            p = p.children[prefix.charAt(i)-'a'];
        }
        return true;
    }
}

// Your Trie object will be instantiated and called as such:
// Trie trie = new Trie();
// trie.insert("somestring");
// trie.search("key");