LeetCode 49 Binary Tree Zigzag Level Order Traversal

最新推荐文章于 2021-02-05 11:10:39 发布

JavyZheng

最新推荐文章于 2021-02-05 11:10:39 发布

阅读量676

点赞数

CC 4.0 BY-SA版权

分类专栏： LeetCode 文章标签：二叉树蛇形遍历栈 LeetCode

本文链接：https://blog.youkuaiyun.com/javyzheng/article/details/38959095

LeetCode 专栏收录该内容

151 篇文章

订阅专栏

本博客介绍了一种二叉树层序遍历的变种，即zigzag level order traversal，通过使用栈实现每层元素反向的特性。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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,#,#,15,7},

return its zigzag level order traversal as:

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

分析：

层序遍历的变种，每层反向，可用栈代替队列来实现反向。

/**
 * Definition for binary tree
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    public List<List<Integer>> zigzagLevelOrder(TreeNode root) {
        List<List<Integer>> result = new ArrayList<List<Integer>>();
        if(root==null) return result;
        Stack<TreeNode> st1 = new Stack<TreeNode>();
        Stack<TreeNode> st2 = new Stack<TreeNode>();
        st1.push(root);
        while(st1.size()>0 || st2.size()>0 ){
            List<Integer> level = new ArrayList<Integer>();
            if(st1.size()>0){
                while(st1.size()>0){
                    TreeNode temp = st1.pop();
                    level.add(temp.val);
                    if(temp.left != null) st2.push(temp.left);
                    if(temp.right != null) st2.push(temp.right);
                }
                result.add(level);
                continue;
            }
            if(st2.size()>0){
                while(st2.size()>0){
                    TreeNode temp = st2.pop();
                    level.add(temp.val);
                    if(temp.right!= null) st1.push(temp.right);
                    if(temp.left != null) st1.push(temp.left);
                }
                result.add(level);
            }
        }
        return result;
    }
}