二叉树的层序遍历 利用队列来做
import java.util.ArrayList;
import java.util.Queue;
import java.util.LinkedList;
/**
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> result=new ArrayList<>();
if(root==null) return result;
queue.offer(root);
while(!queue.isEmpty()){
TreeNode cur=queue.poll();
result.add(cur.val);
if(cur.left!=null)
queue.offer(cur.left);
if(cur.right!=null)
queue.offer(cur.right);
}
return result;
}
}
剑指offer 二叉树的层序遍历
最新推荐文章于 2020-11-02 19:15:44 发布