Leetcode 102. 二叉树的层序遍历

js版

 var levelOrder = function (node) {
    const res = [];
    if (node) {
      node.index = 0;
      const list = [node];
      while (list.length) {
        let node = list.shift(), index = node.index;
        ((res[index] = res[index] || []), res[index]).push(node.val);
        index++;
        if (node.left) list.push((node.left.index = index, node.left));
        if (node.right) list.push((node.right.index = index, node.right));
      }
    }
    return res;
  }