Design Add and Search Words Data Structure

trie.rb

class TrieNode
  attr_accessor :childrens, :leaf
  def initialize
    self.childrens = {}
    self.leaf = false
  end
end

class WordDictionary

  def initialize
    @root = TrieNode.new
  end

  def addWord(word)
    return if word.length < 0 || word.length > 25

    temp = @root
    word.each_char do |c|
      temp.childrens[c] ||= TrieNode.new
      temp = temp.childrens[c]
    end
    temp.leaf = true
  end

  def search(word)
    temp = @root
    puts dfs(temp, word, 0)
  end

  def dfs(node, word, index)
    if node.childrens.key?(word[index])
      child = node.childrens[word[index]]
      return true if child.leaf && index == word.length - 1

      return dfs(child, word, index + 1)
    end

    false
  end
end


wordDictionary = WordDictionary.new
wordDictionary.addWord("bad")
wordDictionary.addWord("dad")
wordDictionary.addWord("mad")
wordDictionary.search("pad")
wordDictionary.search("bad")
wordDictionary.search("mad")