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,null,null,15,7]
,
3 / \ 9 20 / \ 15 7
return its bottom-up level order traversal as:
[ [15,7], [9,20], [3] ]
从底端,左到右获取结果:
可以在原来所有遍历的方法下,然后对list进行反转
public List<List<Integer>> levelOrderBottom(TreeNode root) {
List<List<Integer>> res = new ArrayList<>();
if(root == null) {
return res;
}
Queue<TreeNode> tmp = new LinkedList<>();
tmp.add(root);
while(tmp!=null && !tmp.isEmpty()) {
int size = tmp.size();
List<Integer> tmpRes = new ArrayList<>();
for(int index=0;index<size;index++) {
TreeNode now = tmp.poll();
tmpRes.add(now.val);
if(now.left!=null) tmp.offer(now.left);
if(now.right!=null) tmp.offer(now.right);
}
res.add(tmpRes);
}
Collections.reverse(res);
return res;
}