class TrieNode {
    Character c;
    Boolean isLeaf = false;
    HashMap<Character, TrieNode> children = new HashMap<>();
    public TrieNode() {}
    public TrieNode(Character c) {
        this.c = c;
    }
}

class Trie {
    private TrieNode root;
    
    // Implement these methods : 
    public Trie() {}
    public void insertWord(String word) {}
    public Boolean searchWord(String word) {}
    public Boolean searchPrefix(String word) {}
}


This Coding Interview Question is available with an answer in the following programming languages :