题目
-
请实现一个函数按照之字形打印二叉树,即第一行按照从左到右的顺序打印,第二层按照从右至左的顺序打印,第三行按照从左到右的顺序打印,其他行以此类推。
-
例如:给定二叉树: [3,9,20,null,null,15,7],返回
[
[3],
[20,9],
[15,7]
]3
/ \
9 20
/ \
15 7 -
leetcode链接:https://leetcode-cn.com/problems/cong-shang-dao-xia-da-yin-er-cha-shu-iii-lcof/submissions/
代码
/**
* 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 = []
let flag = true
while (queue.length) {
let counts = queue.length
const row = []
while(counts) {
const node = queue.shift()
node.left && queue.push(node.left)
node.right && queue.push(node.right)
if (flag) {
row.push(node.val)
} else {
row.unshift(node.val)
}
counts--
}
flag = !flag
result.push(row)
}
return result
};