102. 二叉树的层序遍历
/**
* Definition for a binary tree node.
* function TreeNode(val, left, right) {
* this.val = (val===undefined ? 0 : val)
* this.left = (left===undefined ? null : left)
* this.right = (right===undefined ? null : right)
* }
*/
/**
* @param {TreeNode} root
* @return {number[][]}
*/
var levelOrder = function(root) {
if(root===null)
{
return []
}
let ans = []
let cur = [root]
while(cur.length){
let next = []
let vals = []
for(let node of cur){
vals.push(node.val)
if(node.left){
next.push(node.left)
}
if(node.right){
next.push(node.right)
}
}
cur = next
ans.push(vals)
}
return ans
};
执行用时分布
80ms
击败48.60%
消耗内存分布
54.93MB
击败
36.67%