从上往下打印二叉树。
1. 题目描述
从上往下打印出二叉树的每个节点,同层节点从左至右打印。
2. 解题思路
(1)可以用一个队列来模拟从上到下打印的过程,在数据结构中它也被称为广度遍历。操作的过程中要注意从队列中移除结点的同时把它的左右结点以进队列中。
(2)…实现方法2
3. 代码实现
(1)
import java.util.*;
/**
public class TreeNode {
int val = 0;
TreeNode left = null;
TreeNode right = null;
public TreeNode(int val) {
this.val = val;
}
}
*/
public class Solution {
public ArrayList<Integer> PrintFromTopToBottom(TreeNode root) {
Queue<TreeNode> queue = new LinkedList<>();
ArrayList<Integer> arrayList = new ArrayList<>();
if (root == null)
return arrayList;
queue.offer(root);
while (queue.peek() != null){
TreeNode node = queue.poll();
arrayList.add(node.val);
if (node.left !=null)
queue.offer(node.left);
if (node.right != null)
queue.offer(node.right);
}
return arrayList;
}
}
(2)
import java.util.*;
/**
public class TreeNode {
int val = 0;
TreeNode left = null;
TreeNode right = null;
public TreeNode(int val) {
this.val = val;
}
}
*/
public class Solution {
public ArrayList<Integer> PrintFromTopToBottom(TreeNode root) {
Queue<TreeNode> queue = new LinkedList<>();
ArrayList<Integer> arrayList = new ArrayList<>();
if (root == null)
return arrayList;
queue.offer(root);
while (!queue.isEmpty()){
int count = queue.size();
while (count-- > 0){
TreeNode node = queue.poll();
if (node == null)
continue;
arrayList.add(node.val);
queue.offer(node.left);
queue.offer(node.right);
}
}
return arrayList;
}
}