题目描述:
给定一个二叉树,返回其按层次遍历的节点值。 (即逐层地,从左到右访问所有节点)。
例如:
给定二叉树: [3,9,20,null,null,15,7],
3
/ \
9 20
/ \
15 7
返回其层次遍历结果:
[
[3],
[9,20],
[15,7]
]
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/binary-tree-level-order-traversal
/**
* 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 [];
let res = [], temp = [root];
while(temp.length) {
let arr = [], help = [];
for(let i = 0; i < temp.length; i++) {
if(!temp[i]) continue;
arr.push(temp[i].val);
help.push(temp[i].left);
help.push(temp[i].right);
}
temp = help.concat();
if(arr.length) res.push(arr);
}
return res;
};