队列&&栈-----Binary Tree Level Order Traversal II

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).

Have you met this question in a real interview? Yes
Example
Given binary tree {3,9,20,#,#,15,7},

3

/ \
9 20
/ \
15 7

return its bottom-up level order traversal as:

[
[15,7],
[9,20],
[3]
]

/**
 * Definition of TreeNode:
 * public class TreeNode {
 *     public int val;
 *     public TreeNode left, right;
 *     public TreeNode(int val) {
 *         this.val = val;
 *         this.left = this.right = null;
 *     }
 * }
 */


public class Solution {
    /**
     * @param root: The root of binary tree.
     * @return: buttom-up level order a list of lists of integer
     */
    public ArrayList<ArrayList<Integer>> levelOrderBottom(TreeNode root) {
        // write your code here
        ArrayList<ArrayList<Integer>> result = new ArrayList<ArrayList<Integer>>();
        if(root==null) return result;

        Stack<ArrayList<Integer>> s = new Stack<ArrayList<Integer>>();
        Queue<TreeNode> q = new LinkedList <TreeNode>();
        q.offer(root);

        while(!q.isEmpty()){
          int qLen= q.size();
          ArrayList<Integer> aList = new ArrayList<Integer>();
          for (int i = 0;i<qLen ;i++ ) {
            TreeNode node = q.poll();
            aList.add(node.val);
            if(node.left!=null) q.offer(node.left);
            if(node.right!=null)q.offer(node.right);

          }
          s.push(aList);
        }
        while(!s.empty())
          result.add(s.pop());

          return result;
    }
}