二叉数的层序遍历是从上到下,从左到右来遍历
层序遍历的结果就是28 16 30 13 22 29 42
import java.util.ArrayList;
public class Solution {
public ArrayList<Integer> PrintFromTopToBottom(TreeNode root) {
ArrayList<Integer> list = new ArrayList<>();
ArrayList<TreeNode> queue = new ArrayList<>();
if(root == null) {
return list;
}
queue.add(root);
while(!queue.isEmpty()) {
TreeNode first = queue.remove(0);
list.add(first.val);
if(first.left != null) {
queue.add(first.left);
}
if(first.right != null) {
queue.add(first.right);
}
}
return list;
}
}
如果不明白可以看
b站详解