求二叉树的层序遍历
题目描述
给定一个二叉树,返回该二叉树层序遍历的结果,(从左到右,一层一层地遍历)
例如:
给定的二叉树是{3,9,20,#,#,15,7},
该二叉树层序遍历的结果是
[
[3],
[9,20],
[15,7]
]
代码
import java.util.*;
/*
* public class TreeNode {
* int val = 0;
* TreeNode left = null;
* TreeNode right = null;
* }
*/
public class Solution {
/**
*
* @param root TreeNode类
* @return int整型ArrayList<ArrayList<>>
*/
public ArrayList<ArrayList<Integer>> levelOrder (TreeNode root) {
// write code here
ArrayList<ArrayList<Integer>> res = new ArrayList<>();
if(root==null) return res;
ArrayList<TreeNode> q = new ArrayList<>();
q.add(root);
while( !q.isEmpty() ){
//每一层的数量
int s = q.size();
//存储每一层的值
ArrayList<Integer> curlist = new ArrayList<>();
//获取该层的值,并将下一层的节点添加到队尾
for(int i = 0; i < s; i++){
TreeNode t = q.get(0);
curlist.add(t.val);
// curlist.add( q.poll().val );
if(t.left!=null) q.add(t.left); //哭,写成了root,愣是找错误找了半天 root.left!=null、q.add(root.left)
if(t.right!=null) q.add(t.right);
q.remove(0);
}
res.add(curlist);
}
return res;
}
}