链接
牛客:从上往下打印二叉树
LeetCode:剑指 Offer 32 - I. 从上到下打印二叉树
思路
这个相当于二叉树的层次遍历,属于基础中的基础。需要借助一个辅助的队列。
代码
牛客:
import java.util.ArrayList;
import java.util.LinkedList;
import java.util.List;
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 {
public ArrayList<Integer> PrintFromTopToBottom(TreeNode root) {
ArrayList<Integer> list = new ArrayList<Integer>();
if (root == null)
return list;
Queue<TreeNode> queue = new LinkedList<TreeNode>();
//先将根节点压入queue中
queue.add(root);
while (!queue.isEmpty()) {
TreeNode temp = queue.peek();
queue.remove();
list.add(temp.val);
if (temp.left != null)
queue.add(temp.left);
if (temp.right != null)
queue.add(temp.right);
}
return list;
}
}
LeetCode:
class Solution {
public int[] levelOrder(TreeNode root) {
if (root == null) {
return new int[0];
}
List<Integer> list = new ArrayList<>();
Queue<TreeNode> queue = new LinkedList<>();
queue.offer(root);
while (!queue.isEmpty()) {
int num = queue.size();
for (int i = 0; i < num; i++) {
TreeNode treeNode = queue.poll();
list.add(treeNode.val);
if (treeNode.left != null)
queue.offer(treeNode.left);
if (treeNode.right != null)
queue.offer(treeNode.right);
}
}
int[] result = new int[list.size()];
int i = 0;
for (Integer val : list) {
result[i++] = val;
}
return result;
}
}