Class TrieNode

contents/data-structure/code/Trie/TrieExample.java:53–64

}

class TrieNode {
    TrieNode[] children = new TrieNode[26];
    boolean isEnd;

    TrieNode getChild(char c) {
        return children[c - 'a'];
    }

    boolean hasChild(char c) {
        return children[c - 'a'] != null;
    }
}