LeetCode103:二叉树的锯齿形层次遍历

凌晨两点半还不回家

于 2020-07-14 08:05:34 发布

阅读量58

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/qq_35654080/article/details/107087291

版权

LeetCode 专栏收录该内容

103 篇文章 0 订阅

订阅专栏

/**
 * 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>> ans = new ArrayList<>();
        if(root == null){
            return ans;
        }
        //建立队列
        Queue<TreeNode> q = new LinkedList<>();
        //将根节点放入队列
        q.add(root);
        int cnt = 0;
        //队列不为空时
        while(!q.isEmpty()){
            List<Integer> tem = new ArrayList<>();
            int size = q.size();
            for(int i = 0;i<size;i++){
                TreeNode cur = q.poll();
                if(cur == null) continue;
                
                if(cnt%2==0){
                    tem.add(cur.val);
                }
                else{
                    tem.add(0,cur.val);
                }
                q.add(cur.left);
                q.add(cur.right);
                

            }
            cnt++;
            if(!tem.isEmpty()){
                ans.add(tem);
            }
        }
        return ans;

    }
}