import java.util.*;
class TreeNode {
int val;
TreeNode left;
TreeNode right;
TreeNode(int x) { val = x; }
}
public class Solution {
public ArrayList<ArrayList<Integer>> levelOrderBottom(TreeNode root) {
ArrayList<ArrayList<Integer>>res=new ArrayList<>();
if(root==null) return res;
Queue<TreeNode>queue=new LinkedList<>();
queue.add(root);
while(!queue.isEmpty()){
ArrayList<Integer>list=new ArrayList<>();
int size=queue.size();
for(int i=0;i<size;i++){
TreeNode temp=queue.poll();
list.add(temp.val);
if(temp.left!=null) queue.add(temp.left);
if(temp.right!=null) queue.add(temp.right);
}
res.add(0,list);
}
return res;
}
public static void main(String[]args){
//System.out.println("Hello World!");
TreeNode root=new TreeNode(1);
root.left=new TreeNode(2);
root.right=new TreeNode(3);
root.left.left=new TreeNode(4);
Solution s=new Solution();
System.out.println(s.levelOrderBottom(root));
}
}
自下到上、自左到右打印二叉树
最新推荐文章于 2023-04-02 15:29:53 发布