leetcode 103.二叉树的锯齿形层次遍历 Java

题目链接

https://leetcode-cn.com/problems/binary-tree-zigzag-level-order-traversal/

描述

给定一个二叉树，返回其节点值的锯齿形层次遍历。（即先从左往右，再从右往左进行下一层遍历，以此类推，层与层之间交替进行）。

示例

例如：
给定二叉树 [3,9,20,null,null,15,7],

    3
   / \
  9  20
    /  \
   15   7
返回锯齿形层次遍历如下：

[
  [3],
  [20,9],
  [15,7]
]

初始代码模板

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    public List<List<Integer>> zigzagLevelOrder(TreeNode root) {

    }
}

代码

和二叉树的层序遍历差别不大，bfs和dfs都可以，用奇偶或者其他变量判断左右顺序即可

bfs

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    public List<List<Integer>> zigzagLevelOrder(TreeNode root) {
        List<List<Integer>> res = new LinkedList<>();
        if (root == null) {
            return res;
        }
        
        Queue<TreeNode> queue = new ArrayDeque<>();
        queue.offer(root);
        boolean fromLeft = true;

        while (!queue.isEmpty()) {
            LinkedList<Integer> list = new LinkedList<>();
            for (int i = queue.size(); i > 0; i--) {
                TreeNode node = queue.poll();
                
                if (fromLeft) {
                    list.add(node.val);
                } else {
                    list.addFirst(node.val);
                }

                if (node.left != null) {
                    queue.offer(node.left);
                } 
                if (node.right != null) {
                    queue.offer(node.right);
                }
            }

            res.add(list);
            fromLeft = !fromLeft;
        }

        return res;
    }
}

dfs

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    
    private List<List<Integer>> ans = new ArrayList<>();

    public List<List<Integer>> zigzagLevelOrder(TreeNode root) {
        dfs(root, 0);

        return ans;
    }

    public void dfs(TreeNode root, int height) {
        if (root == null) {
            return;
        }

        if (height == ans.size()) {
            ans.add(new LinkedList<>());
        }

        if ((height & 1) == 0) {
            ans.get(height).add(root.val);
        } else {
            ans.get(height).add(0, root.val);
        }

        dfs(root.left, height + 1);
        dfs(root.right, height + 1);
    }
}