Leetcode 102. Binary Tree Level Order Traversal

Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level).

For example:

Given binary tree {3,9,20,#,#,15,7},

用一个栈维护一层的节点

public ArrayList<ArrayList<Integer>> levelOrderBottom(TreeNode root) {
        ArrayList<ArrayList<Integer>> res = new ArrayList<ArrayList<Integer>>();  
        if(root == null)  
            return res;
        
        LinkedList<TreeNode> queue = new LinkedList<TreeNode>();  
        queue.add(root);
        
        int curLevCnt = 1;  
        int nextLevCnt = 0;  
        
        ArrayList<Integer> levelres = new ArrayList<Integer>();  
       
        while(!queue.isEmpty()){  
            TreeNode cur = queue.poll();  
            curLevCnt--;  
            levelres.add(cur.val);  
            
            if(cur.left != null){  
                queue.add(cur.left);  
                nextLevCnt++;  
            }  
            if(cur.right != null){  
                queue.add(cur.right);  
                nextLevCnt++;  
            }  
              
            if(curLevCnt == 0){  
                curLevCnt = nextLevCnt;  
                nextLevCnt = 0;  
                res.add(0,levelres);  //insert one by one from the beginning
                levelres = new ArrayList<Integer>();  
            }  
        }  
        return res;  
    }