题目:
102:给定一个二叉树,返回其按层次遍历的节点值。 (即逐层地,从左到右访问所有节点)。
例如:
给定二叉树: [3,9,20,null,null,15,7],
3
/ \
9 20
/ \
15 7
返回其层次遍历结果:
[
[3],
[9,20],
[15,7]
]
思路:
-
BFS:搜索即完美符合该题的要求,只是注意如何判断层次信息;
-
DFS: 因为使用递归,递归深度自然就代表了层次信息,所以DFS也是比较适合求解该题;
代码实现:
1,BFS :
/**
*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) {
List<List<Integer>> list = new LinkedList<>();
if(root == null)return list;
Queue<TreeNode> queue = new LinkedList<>();
queue.offer(root);
while(!queue.isEmpty()){
List<Integer> levelList = new LinkedList<>();
int size = queue.size();
for(int i = 0;i < size;++i){
TreeNode node = queue.poll();
levelList.add(node.val);
if(node.left != null)
queue.offer(node.left);
if(node.right != null)
queue.offer(node.right);
}
list.add(levelList);
}
return list;
}
}```
2 DFS:
```javascript
class Solution {
public List<List<Integer>> levelOrder(TreeNode root) {
List<List<Integer>> list = new ArrayList<>();
if(root == null)return list;
return dfs(0,list,root);
}
private List<List<Integer>> dfs(int level,List<List<Integer>> list,TreeNode node){
if(node == null) return list;
List<Integer> levelList;
if(list.size() < level+1){
levelList = new LinkedList<>();
list.add(levelList);
}else{
levelList = list.get(level);
}
levelList.add(node.val);
dfs(level+1,list,node.left);
dfs(level+1,list,node.right);
return list;
}
}