Leetcode 107. 二叉树的层次遍历 II(Java)

最新推荐文章于 2020-10-03 12:30:00 发布

Mr.Letian

最新推荐文章于 2020-10-03 12:30:00 发布

阅读量115

点赞数

本文链接：https://blog.csdn.net/MrMyGod/article/details/108454870

版权

Leetcode 专栏收录该内容

1 篇文章 0 订阅

订阅专栏

107. 二叉树的层次遍历 II

法一：BFS

/**
 * 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>> levelOrderBottom(TreeNode root) {
        if(root==null) return new ArrayList<List<Integer>>();
        List<List<Integer>> res = new LinkedList<List<Integer>>();
        Queue<TreeNode> queue = new LinkedList<TreeNode>();
        queue.offer(root);
        while(!queue.isEmpty()){
            int size = queue.size();
            List<Integer> tmp = new ArrayList<Integer>();
            for(int i=0;i<size;i++){
                TreeNode node = queue.poll();
                tmp.add(node.val);
                if(node.left!=null){
                    queue.offer(node.left);
                }
                if(node.right!=null){
                    queue.offer(node.right);
                }
            }
            res.add(0,tmp);
        }
        return res;
    }
   
}

在这里插入图片描述

法二：DFS

/**
 * 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>> levelOrderBottom(TreeNode root) {
        if(root == null ) return new ArrayList<List<Integer>>();
        ArrayList res = new ArrayList<ArrayList<Integer>>();
        dfs(1, root, res);
        return res;
    }
   public void dfs(int level, TreeNode node, ArrayList<ArrayList<Integer>> res){
       if(node == null){
           return ;
       }
       if(level>res.size()){
           res.add(0, new ArrayList<Integer>());
       }
       //res.get(res.size()-1-level+1).add(node.val);
       res.get(res.size()-level).add(node.val);
       dfs(level+1,node.left,res);
       dfs(level+1,node.right,res);

   }

}