107. Binary Tree Level Order Traversal II

107. Binary Tree Level Order Traversal II

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */

class Solution {
    public List<List<Integer>> levelOrderBottom(TreeNode root) {
        List<List<Integer>>outList=new ArrayList<>();
        levelOrderTraversal(root,outList);
        return outList;
    }
    
    public void levelOrderTraversal(TreeNode node,List<List<Integer>>outlist){
        if(node==null){
            return;
        }
        
        Queue<TreeNode>queue=new LinkedList<>();
        queue.add(node);
        
        while(!queue.isEmpty()){
            int size=0;
            size=queue.size();
            List<Integer>inList=new ArrayList<>();
            System.out.print(queue.size()+" ");
            for(int i=0;i<size;i++){
                TreeNode treeNode=queue.poll();
                inList.add(treeNode.val);
                if(treeNode.left!=null){
                    queue.offer(treeNode.left);
                }
                if(treeNode.right!=null){
                    queue.offer(treeNode.right);
                }
            }
            outlist.add(inList);
    
        }
        Collections.reverse(outlist);
    }
}