给你二叉树的根节点
root
,返回其节点值的 锯齿形层序遍历 。(即先从左往右,再从右往左进行下一层遍历,以此类推,层与层之间交替进行)。示例 1:
输入:root = [3,9,20,null,null,15,7] 输出:[[3],[20,9],[15,7]]示例 2:
输入:root = [1] 输出:[[1]]示例 3:
输入:root = [] 输出:[]提示:
- 树中节点数目在范围
[0, 2000]
内-100 <= Node.val <= 100
/**
* 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[][]}
*/
/**
* 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)
* }
*/
// 奇数行正常的层序遍历
// 偶数行从右往左遍历
// 将偶数行的代码倒叙
var helper = function(root, k, ans){
if(!root) return null;
if(k === ans.length) ans.push(new Array());
if(k%2 === 0){
ans[k].push(root.val);
}else{
ans[k].unshift(root.val);
}
helper(root.left, k+1, ans);
helper(root.right, k+1, ans);
}
var zigzagLevelOrder = function(root) {
var ans = [];
helper(root, 0, ans);
return ans;
};