103 Binary Tree Zigzag Level Order Traversal

最新推荐文章于 2020-06-07 02:08:27 发布

dongbeier

最新推荐文章于 2020-06-07 02:08:27 发布

阅读量70

点赞数

分类专栏： LeetCode Linkedin MicroSoft

本文链接：https://blog.csdn.net/dongbeier/article/details/80276301

版权

LeetCode 同时被 3 个专栏收录

146 篇文章 0 订阅

订阅专栏

MicroSoft

85 篇文章 0 订阅

订阅专栏

50 篇文章 0 订阅

订阅专栏

Given a binary tree, return the zigzag level order traversal of its nodes' values. (ie, from left to right, then right to left for the next level and alternate between).

For example:
Given binary tree [3,9,20,null,null,15,7],

return its zigzag level order traversal as:

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

广度优先遍历，用一个bool记录是从左到右还是从右到左，每一层结束就翻转一下

递归

/**
 * 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 ArrayList<>();
        boolean leftToRight = true;
        traverse(root, 0, leftToRight, res);
        return res;
    }
    
    private void traverse(TreeNode root, int level, boolean leftToRight,
                         List<List<Integer>> res) {
        if (root == null) {
            return;
        }
        
        if (level >= res.size()) {
            res.add(new ArrayList<>());
        }
        
        if (leftToRight) {
            res.get(level).add(root.val);
        } else {
            res.get(level).add(0, root.val);
        }
        
        traverse(root.left, level+1, !leftToRight, res);
        traverse(root.right, level+1, !leftToRight, res);
    }
}

迭代

/**
 * 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 ArrayList<>();
        Queue<TreeNode> curr = new LinkedList<>();
        Queue<TreeNode> next = new LinkedList<>();
        boolean leftToRight = true;
        
        if (root == null) {
            return res;
        } else {
            curr.add(root);
        }
        
        while (!curr.isEmpty()) {
            List<Integer> level = new ArrayList<>();
            while (!curr.isEmpty()) {
                TreeNode node = curr.poll();
                level.add(node.val);
                
                if (node.left != null) {
                    next.add(node.left);
                }
                
                if (node.right != null) {
                    next.add(node.right);
                }
            }
            if (!leftToRight) {
                Collections.reverse(level);
            }
            res.add(level);
            leftToRight = !leftToRight;
            
            Queue tmp = curr;
            curr = next;
            next = tmp;
        }
        return res;
    }
}