題目
給出一棵二叉樹，返回其節(jié)點(diǎn)值從底向上的層次序遍歷（按從葉節(jié)點(diǎn)所在層到根節(jié)點(diǎn)所在的層遍歷靶庙，然后逐層從左往右遍歷）
樣例
給出一棵二叉樹 {3,9,20,#,#,15,7},
Paste_Image.png
代碼
/**
* Definition of TreeNode:
* public class TreeNode {
* public int val;
* public TreeNode left, right;
* public TreeNode(int val) {
* this.val = val;
* this.left = this.right = null;
* }
* }
*/
public class Solution {
/**
* @param root: The root of binary tree.
* @return: buttom-up level order a list of lists of integer
*/
public ArrayList<ArrayList<Integer>> levelOrderBottom(TreeNode root) {
// write your code here
if(root == null)
return new ArrayList<>();
ArrayList<ArrayList<Integer>> res = new ArrayList<>();
Queue<TreeNode> list = new LinkedList<>();
list.offer(root);
while(!list.isEmpty()) {
int size = list.size();
ArrayList<Integer> level = new ArrayList<>();
for(int i=0;i<size;i++) {
TreeNode cur = list.poll();
level.add(cur.val);
if(cur.left != null)
list.offer(cur.left);
if(cur.right != null)
list.offer(cur.right);
}
res.add(level);
}
Collections.reverse(res);
return res;
}
}
