请实现一个函数按照之字形顺序打印二叉树,即第一行按照从左到右的顺序打印,第二层按照从右到左的顺序打印,第三行再按照从左到右的顺序打印,其他行以此类推。
例如:
给定二叉树: [3,9,20,null,null,15,7],
3
/ \
9 20
/ \
15 7
返回其层次遍历结果:
[
[3],
[20,9],
[15,7]
]
提示:
节点总数 <= 1000
通过次数35,695提交次数61,073
/**
* 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 res = [];
if(!root) return res;
const q = [];
root.len = 0;
q.push(root);
while(q.length !== 0) {
const top = q.shift();
const len = top.len;
if(!res[len]) {
res[len] = [];
}
if(len % 2 === 0) {
res[len].push(top.val);
}
else {
res[len].unshift(top.val);
}
if(top.left) {
top.left.len = len + 1;
q.push(top.left);
}
if(top.right) {
top.right.len = len + 1;
q.push(top.right);
}
}
return res;
};