102.二叉树的层序遍历
102. 二叉树的层次遍历
给定二叉树[3,9,20,null,null,15,7]
3
/ \
9 20
/ \
15 7
返回层序遍历结果
[
[3],
[9,20],
[15,7]
]
思路:
利用队列来完成,
如果根节点为非空, 根节点入队, 一直遍历当前层次的节点
class Solution{
public List<List<Integer>> levelOrder(TreeNode root){
List<List<Integer>> res = new ArrayList();
List<TreeNode> list = new ArrayList();
if(root ==null) return res;
list.add(root);
//根节点非空就一直遍历
while(!list.isEmpty()){
List<Integer> curList = new ArrayList();
List<TreeNode> nextList = new ArrayList();
//遍历当前层所有的节点
for(TreeNode cur:list){
//添加当前层节点的值放入curList中
curList.add(cur.val);
//确定下一层的节点
if(cur.left !=null) nextList.add(cur.left);
if(cur.right !=null) nextList.add(cur.right);
}
//list赋值为下一层的节点
list = nextList;
res.add(curList);
}
return res;
}
}
利用queue
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
class Solution {
public List<List<Integer>> levelOrder(TreeNode root) {
if(root ==null) return new ArrayList<>();
List<List<Integer>> res = new ArrayList<>();
Queue<TreeNode> queue = new LinkedList<TreeNode>();
queue.add(root);
while(!queue.isEmpty()){
int count = queue.size();
List<Integer> list = new ArrayList<Integer>();
while(count>0){
TreeNode node = queue.poll();
list.add(node.val);
if(node.left !=null){
queue.add(node.left);
}
if(node.right != null){
queue.add(node.right);
}
count--;
}
res.add(list);
}
return res;
}
}