例:给你一个二叉树,请你返回其按 层序遍历 得到的节点值。 (即逐层地,从左到右访问所有节点)。
示例:
二叉树:[3,9,20,null,null,15,7],
返回其层序遍历结果:
[
[3],
[9,20],
[15,7]
]
一、广度优先bfs实现
public List<List<Integer>> levelOrder2(TreeNode root) {
List<List<Integer>> res = new ArrayList<>();
LinkedList<TreeNode> linkedList = new LinkedList<>();
if(root==null)return res;
linkedList.addLast(root);
while (linkedList.size()>0){
List<Integer> temp = new ArrayList<>();
int size = linkedList.size();
for (int i = 0; i < size; i++) {
TreeNode first = linkedList.removeFirst();
temp.add(first.val);
if(first.left!=null){
linkedList.addLast(first.left);
}
if(first.right!=null){
linkedList.addLast(first.right);
}
}
res.add(temp);
}
return res;
}
二、dfs深度优先实现
public List<List<Integer>> levelOrder(TreeNode root) {
List<List<Integer>> res = new ArrayList<>();
if (root == null) return res;
dfs(0, root, res);
return res;
}
private void dfs(int level, TreeNode root, List<List<Integer>> res) {
if (res.size() == level) {
res.add(new ArrayList<>());
}
res.get(level).add(root.val);
if (root.left != null) {
dfs(level + 1, root.left, res);
}
if (root.right != null) {
dfs(level + 1, root.right, res);
}
}