题目描述
从上到下按层打印二叉树,同一层结点从左至右输出。每一层输出一行。
import java.util.ArrayList;
import java.util.LinkedList;
import java.util.Queue;
/*
public class TreeNode {
int val = 0;
TreeNode left = null;
TreeNode right = null;
public TreeNode(int val) {
this.val = val;
}
}
*/
public class Solution {
ArrayList<ArrayList<Integer> > Print(TreeNode pRoot) {
ArrayList<ArrayList<Integer>> arrPlus = new ArrayList<>();
if(pRoot == null)
return arrPlus;
else {
Queue<TreeNode> queue = new LinkedList<>();
queue.add(pRoot);
TreeNode nlast = pRoot;
TreeNode last = pRoot;
ArrayList<Integer> arr = new ArrayList<>();
while (!queue.isEmpty()) {
TreeNode cur = queue.remove();
arr.add(cur.val);
System.out.print(cur.val);
if (cur.left != null) {
queue.add(cur.left);
nlast = cur.left;
}
if (cur.right != null) {
queue.add(cur.right);
nlast = cur.right;
}
if(last.val == cur.val){
System.out.println();
last = nlast;
arrPlus.add(arr);
arr = new ArrayList<>();
}
}
return arrPlus;
}
}
}