https://leetcode.com/problems/binary-tree-level-order-traversal-ii/
解题思路:
和 Binary Tree Level Order Traversal 类似,最后将结果反转一下就好。
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
public class Solution {
public List<List<Integer>> levelOrderBottom(TreeNode root) {
List<List<Integer>> result = new ArrayList<>();
Queue<TreeNode> queue = new LinkedList<>();
if (root == null) return result;
queue.add(root);
while (!queue.isEmpty()) {
List<Integer> list = new ArrayList<>();
int size = queue.size();
for (int i=0; i<size; i++) {
root = queue.poll();
list.add(root.val);
if (root.left != null)
queue.add(root.left);
if (root.right != null)
queue.add(root.right);
}
result.add(list);
}
Collections.reverse(result);
return result;
}
}