Trie (Prefix Tree) — Deep Dive

class TrieNode {
  Map children = new HashMap<>();
  boolean isEnd;
}

void insert(String word) {
  TrieNode cur = root;
  for (char c : word.toCharArray()) {
    cur = cur.children.computeIfAbsent(c, k -> new TrieNode());
  }
  cur.isEnd = true;
}
boolean search(String word) {
  TrieNode cur = root;
  for (char c : word.toCharArray()) {
    cur = cur.children.get(c);
    if (cur == null) return false;
  }
  return cur.isEnd;
}