leetcode #107. Binary Tree Level Order Traversal II

7. Binary Tree Level Order Traversal II
   Easy

1039

186

Add to List

Share
Given a binary tree, return the bottom-up level order traversal of its nodes’ values. (ie, from left to right, level by level from leaf to root).

For example:
Given binary tree [3,9,20,null,null,15,7],
3
/
9 20
/
15 7
return its bottom-up level order traversal as:
[
[15,7],
[9,20],
[3]
]

思路本体和 102题思路基本一直
运用queue的先进先出的特性， 每次pop出的加入list
唯一不同的是在最后加入res时每次都添加到最前位置res.add(0,list) ;

class Solution {
    public List<List<Integer>> levelOrderBottom(TreeNode root) {
         List<List<Integer>> res = new ArrayList<>();
         
        if(root == null){
            return res;
        }
        
        LinkedList<TreeNode> queue = new LinkedList<>();
        queue.offer(root);
        while(!queue.isEmpty()){
            int size = queue.size();
            List<Integer> list = new ArrayList<>();
            for(int i = 0; i < size ; i++){
                
                TreeNode node = queue.pop();
                list.add(node.val);
                if(node.left != null){
                    queue.offer(node.left);
                }
                 if(node.right != null){
                    queue.offer(node.right);
                }
            }
             res.add(0,list) ; 
            
            
        }
        return res;
    }
}