Method insert

kotlin/Tries/DesignATrie.kt:9–22

    val root = TrieNode()

    fun insert(word: String) {
        var node = root
        for (c in word.toCharArray()) {
            // For each character in the word, if it's not a child of
            // the current node, create a new TrieNode for that
            // character.
            if (c !in node.children) {
                node.children[c] = TrieNode()
            }
            node = node.children[c]!!
        }
        // Mark the last node as the end of a word.
        node.isWord = true
    }

    fun search(word: String): Boolean {
        var node = root