二叉树的层次遍历

Tips

题目类型: Tree

相关题目:

• 103. 二叉树的锯齿形层序遍历

题目

编写二叉树的层次遍历算法, 返回每层的值.

示例

  3
 / \
9 20
  / \
 15  7

输入: root = [3, 9, 20, null, null, 15, 7]

输出: [[3], [9, 20], [15, 7]]

题解

广度优先遍历(层次遍历)的核心思想是队列, 具体思想可以看 深度/广度优先遍历.

/**
 * Definition for a binary tree node.
 * function TreeNode(val) {
 *     this.val = val;
 *     this.left = this.right = null;
 * }
 */
/**
 * @param {TreeNode} root
 * @return {number[][]}
 */
var levelOrder = function (root) {
  const levels = []
  if (!root) return levels

  const queue = [root]

  while (queue.length !== 0) {
    const currLevelLength = queue.length
    const temp = []

    for (let i = 0; i < currLevelLength; i++) {
      const node = queue.shift()
      temp.push(node.val)

      if (node.left) queue.push(node.left)
      if (node.right) queue.push(node.right)
    }

    levels.push(temp)
  }

  return levels
}