二叉树层次遍历（Java版）

/**
 * 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) {
            List<List<Integer>> lslink=new ArrayList<List<Integer>>();
		 	Queue<TreeNode> queue=new LinkedList<TreeNode>();
		 	
		 	if(root==null) {
		 		return lslink;
		 	}
		 	
		 	queue.offer(root);
		 	
		 	while(!queue.isEmpty()) {
		 		int length=queue.size();
		 		List<Integer> list=new ArrayList<Integer>();
		 		
		 		for(int i=0;i<length;i++) {
		 			TreeNode current=queue.poll();
		 			list.add(current.val);
		 			if(current.left!=null) {
		 				queue.offer(current.left);
		 			}
		 			if(current.right!=null) {
		 				queue.offer(current.right);
		 			}
		 		}
		 		lslink.add(list);
		 		
		 	}
        
		 	List<List<Integer>> reverselslink=new ArrayList<List<Integer>>();
		 	Stack<List<Integer>> sk=new Stack();
		 	for(List<Integer> ls : lslink ) {
		 		sk.add(ls);
		 	}
		 	while(!sk.isEmpty()) {
		 		reverselslink.add(sk.pop());
		 	}
		 	return reverselslink;
    }
}