Implement the Trie data structure for storing worlds in an efficient way.

trie.js

function Node(character) {
  this.value = character;
  this.endOfWord = false;
  this.children = {};
}

class Trie {
  constructor() {
    this.root = new Node(null);
  }
  
  insert(word) {
    let current = this.root;
    
    for (let char of word) {
      if (current.children[char] === undefined) {
        current.children[char] = new Node(char);
      }
      
      current = current.children[char];
    }
    
    current.endOfWord = true;
  }
  
  search(word) {
    let current = this.root;
    
    for (let char of word) {
      if (current.children[char] === undefined) {
        return false;
      }
      
      current = current.children[char];
    }
    
    return current.endOfWord;
  }
}

const trie = new Trie();

trie.insert('hello');
trie.insert('world');

console.log(trie.search('world'));