Binary Tree Level Order Traversal II

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

xinglu31

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

阅读量710

点赞数

分类专栏： LeetCode Leetcode记录文章标签： leetcode

本文链接：https://blog.csdn.net/xinglu31/article/details/25155987

版权

Leetcode记录同时被 2 个专栏收录

34 篇文章 0 订阅

订阅专栏

LeetCode

14 篇文章 0 订阅

订阅专栏

/**
 * Definition for binary tree
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    public ArrayList<ArrayList<Integer>> levelOrderBottom(TreeNode root) {
        ArrayList<ArrayList<Integer>> resR = new ArrayList<ArrayList<Integer>>();
        ArrayList<TreeNode> treeNodeTmp = new ArrayList<TreeNode>();
        if(root == null){
            return resR;
        }else{
            treeNodeTmp.add(root);
            ArrayList<ArrayList<Integer>> res = new ArrayList<ArrayList<Integer>>();
            while(treeNodeTmp.size() != 0){
                ArrayList<Integer> resTmp = new ArrayList<Integer>();
                ArrayList<TreeNode> treeNodeTmpWhile = new ArrayList<TreeNode>();
                for(int i = 0 ; i < treeNodeTmp.size() ; i++){
                    TreeNode tmp = treeNodeTmp.get(i);
                    resTmp.add(tmp.val);
                    //System.out.print(tmp.val);
                    if(tmp.left != null){
                        treeNodeTmpWhile.add(tmp.left);
                    }
                    if(tmp.right != null){
                        treeNodeTmpWhile.add(tmp.right);
                    }
                }
                res.add(resTmp);
                treeNodeTmp = treeNodeTmpWhile;
            }
            for(int i = res.size() - 1 ; i>= 0 ;i--){
                resR.add(res.get(i));
            }
        }
        return resR;
    }
}

看过题解，参考队列方法