Binary Tree Level Order Traversal II

最新推荐文章于 2019-06-27 15:08:13 发布

okiwilldoit

最新推荐文章于 2019-06-27 15:08:13 发布

阅读量469

点赞数

分类专栏：算法数据结构

本文链接：https://blog.csdn.net/okiwilldoit/article/details/18708659

版权

算法数据结构专栏收录该内容

93 篇文章 1 订阅

订阅专栏

在层次遍历的基础上，反转ArrayList<ArrayList<Integer>>就可以了

public ArrayList<ArrayList<Integer>> levelOrderBottom(TreeNode root) {
        ArrayList<ArrayList<Integer>> lists = new ArrayList<ArrayList<Integer>>();  
        if(root == null)return lists;  
        Queue<TreeNode> Q = new ArrayDeque<TreeNode>();  
        TreeNode p = root;  
        Q.offer(p);  
        int count = 1;         
        while(!Q.isEmpty()){  
            ArrayList<Integer> list = new ArrayList<Integer>();  
            int nextCount = 0;  
            for(int i = 0;i<count;i++){  
                p = Q.poll();  
                list.add(p.val);              
                if(p.left != null){  
                    Q.offer(p.left);  
                    nextCount++;  
                }  
                if(p.right != null){  
                    Q.offer(p.right);  
                    nextCount++;  
                }  
            }  
            lists.add(list);  
            count = nextCount;   
        }
        
        int length = lists.size();
        ArrayList<Integer> temp1 = new ArrayList<Integer>();
        ArrayList<Integer> temp2 = new ArrayList<Integer>();
        for(int i = 0;i<length/2;i++){
            temp1 = lists.get(i);
            temp2 = lists.get(length-1-i);
            lists.set(i,temp2);
            lists.set(length-1-i,temp1);
        }
        return lists;
    }