难度中等555收藏分享切换为英文接收动态反馈
给你二叉树的根节点 root
,返回其节点值 自底向上的层序遍历 。 (即按从叶子节点所在层到根节点所在的层,逐层从左向右遍历)
示例 1:
输入:root = [3,9,20,null,null,15,7] 输出:[[15,7],[9,20],[3]]
示例 2:
输入:root = [1] 输出:[[1]]
示例 3:
输入:root = [] 输出:[]
提示:
- 树中节点数目在范围
[0, 2000]
内 -1000 <= Node.val <= 1000
/**
* 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) {
List<List<Integer>> list = new ArrayList<List<Integer>>();
List<TreeNode> queue = new ArrayList<>();
if(root == null)
return list;
queue.add(root);
while(queue.size()!=0) {
List<Integer> list1 = new ArrayList<>();
int n = queue.size();
for(int i = 0;i<n;i++) {
TreeNode t = queue.get(0);
queue.remove(0);
list1.add(t.val);
if(t.left!=null)
queue.add(t.left);
if(t.right!=null)
queue.add(t.right);
}
list.add(0,list1);
}
return list;
}
}