/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
广度优先遍历:
思路:利用队列和双层list来进行广度优先遍历,首先 将 3 节点加入到队列中,弹出,再将3的子节点 9 20 加入队列,弹出,再将9 20 的子节点加入队列,弹出~,就是酱紫
class Solution {
public List<List<Integer>> levelOrder(TreeNode root) {
List<List<Integer>> list = new ArrayList<>();
if(root==null) return list;
Queue<TreeNode> temp = new LinkedList<>();
temp.add(root);
while(temp.size()>0){
int cur = temp.size();
List<Integer> level = new ArrayList<>();
while(cur-->0){
TreeNode outNode = temp.poll();
if(outNode.left!=null){
temp.add(outNode.left);
}
if(outNode.right!=null){
temp.add(outNode.right);
}
level.add(outNode.val);
}
list.add(level);
}
return list;
}
}
深度优先遍历:
思路:
class Solution {
List<List<Integer>> ans = new ArrayList<>();
public List<List<Integer>> levelOrder(TreeNode root) {
getSameLevelData(root,0);
return ans;
}
public void getSameLevelData(TreeNode root,Integer hight){
if(root==null) return;
if(ans.size() <= hight) ans.add(new ArrayList<>());
ans.get(hight).add(root.val);
getSameLevelData(root.left,hight+1);
getSameLevelData(root.right,hight+1);
}
每日一题算法题-----二叉树的深度优先遍历和广度优先遍历
最新推荐文章于 2024-05-30 16:17:47 发布