Leetcode 107. Binary Tree Level Order Traversal II
题目链接: Binary Tree Level Order Traversal II
难度:Medium
题目大意:
对二叉树进行层级遍历,从最后一层遍历到第一层,根节点是第一层。
思路:
用Queue来存储二叉树节点,这一层的节点节点出队后把下一层的节点入队。
代码
/**
* 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>> res=new ArrayList<>();
if(root==null){
return res;
}
Queue<TreeNode> queue=new LinkedList<>();
queue.offer(root);
while(!queue.isEmpty()){
int size=queue.size();
List<Integer> levelNodes=new ArrayList<>();
for(int i=0;i<size;i++){
TreeNode node=queue.poll();
levelNodes.add(node.val);
if(node.left!=null){
queue.offer(node.left);
}
if(node.right!=null){
queue.offer(node.right);
}
}
res.add(0,levelNodes);//将levelNodes放在res的头部
}
return res;
}
}