从上到下打印出二叉树的每个节点,同一层的节点按照从左到右的顺序打印。
例如:
给定二叉树: [3,9,20,null,null,15,7],
3
/ \
9 20
/ \
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) {
if(root==null)return []
let res=[],q=[]
q.push(root)
while(q.length){
let len=q.length
for(let i=0;i<len;i++){
let t=q.shift()
res.push(t.val)
if(t.left)q.push(t.left)
if(t.right)q.push(t.right)
}
}
return res
};