题目
-
从上到下按层打印二叉树,同一层结点从左至右输出。每一层输出一行。
-
例如:给定二叉树: [3,9,20,null,null,15,7],返回
[
[3],
[9,20],
[15,7]
]3
/ \
9 20
/ \
15 7 -
leetcode链接:https://leetcode-cn.com/problems/cong-shang-dao-xia-da-yin-er-cha-shu-ii-lcof/
思路
- 组织出每次新的下一轮的队列,并记录本轮队列的值
代码
/**
* 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) {
if (!root) return []
const queue = [root]
const result = []
while (queue.length) {
let counts = queue.length
const row = []
while (counts) {
const node = queue.shift()
row.push(node.val)
node.left && queue.push(node.left)
node.right && queue.push(node.right)
counts--
}
result.push(row)
}
return result
}