import java.util.LinkedList;
import java.util.Queue;
Queue<String> queue = new LinkedList<String>();
add() remove() element() 抛出异常
offer() poll() peek() 返回false null
题目描述
从上往下打印出二叉树的每个节点,同层节点从左至右打印。
运行时间:21ms
占用内存:11060k
import java.util.ArrayList;
/**
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> res = new ArrayList<>();
if(root == null)
return res;
ArrayList<TreeNode> tmps = new ArrayList<>();
tmps.add(root);
while(!tmps.isEmpty() ){
TreeNode tmp = tmps.remove(0);
res.add(tmp.val);
if(tmp.left != null)
tmps.add(tmp.left);
if(tmp.right != null)
tmps.add(tmp.right);
}
return res;
}
}