Breath First Search

breadth-first-search

  bfs(result=[]) {
    const queue = new Queue();
    queue.enqueue(this);
    let node;
    
    while (queue.length) {
      node = queue.dequeue();
      result.push(node.key);

      if (node.left) {
        queue.enqueue(node.left);
      }
      
      if (node.right) {
        queue.enqueue(node.right);
      }
    }

    return result;
  }