107. 二叉树的层序遍历 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>> result  = new ArrayList();
       if (root == null) {
             return result;
       }
       LinkedList<List<Integer>> link  =new LinkedList();
       Queue<TreeNode> queue  = new LinkedList();
       queue.add(root);
       while(queue.size() >0) {
           int size = queue.size();
           List<Integer> list = new ArrayList();
           while(size>0) {
               TreeNode temp = queue.poll();
               list.add(temp.val);
               if (temp.left !=null) {
                   queue.add(temp.left);
               }
               if (temp.right !=null) {
                   queue.add(temp.right);
               }
               size--;
           }
           link.addFirst(new ArrayList(list));
       }
        result = new ArrayList(link);
           return result;
    }
}