解析:(使用队列+翻转结果)
题目要求:给你二叉树的根节点 root
,返回其节点值 自底向上的层序遍历 。
大体思路:只需要正常层序遍历完,反转以下结果即可。
代码:
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
class Solution {
public List<List<Integer>> levelOrderBottom(TreeNode root) {
LinkedList<TreeNode> queue = new LinkedList<>();
List<List<Integer>> res = new ArrayList<>();
if (root == null) return res;
TreeNode cur = root;
queue.add(cur);
while (!queue.isEmpty()) {
ArrayList<Integer> arr = new ArrayList<>();
int size = queue.size();
while (size > 0) {
cur = queue.poll();
arr.add(cur.val);
if (cur.left != null) queue.add(cur.left);
if (cur.right != null) queue.add(cur.right);
size--;
}
res.add(arr);
}
Collections.reverse(res);
return res;
}
}