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

For 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]
]

在102题Binary Tree Level Order Traversal正序遍历的返回结果前调用reverse即可

 public List<List<Integer>> levelOrderBottom(TreeNode root) {
         List<List<Integer>> result = new ArrayList<List<Integer>>();

         if (root == null) return result;
         Queue<TreeNode> nodes = new LinkedList<TreeNode>();
         nodes.add(root);

         int count = 1;
         int level = 0;

         while(!nodes.isEmpty()){
             List<Integer> list = new ArrayList<Integer>();
             level = 0;
             for(int i = 0;i<count; i++){
                 root = nodes.poll();
                 list.add(root.val);
                 if (root.left!=null) {
                     nodes.add(root.left);
                     ++level;
                 }
                 if (root.right!=null) {
                     nodes.add(root.right);
                     ++level;
                 }
             }
             count = level;
             result.add(list);
         }
         Collections.reverse(result);
         return result;
    }