2021-11-21力扣 102. 二叉树的层序遍历 107. 二叉树的层序遍历 II 199. 二叉树的右视图

102. 二叉树的层序遍历

第一种方法dfs实现

/**
 * 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;
 *     }
 * }
 */
class Solution {
       List<List<Integer>> res = new ArrayList<>();
    public List<List<Integer>> levelOrder(TreeNode root) {
        //dfs来实现
       checkFun1(root,0);
       return res;
        
    }
    public void checkFun1(TreeNode node,int deep){
        if(node == null) return ;
        deep++;
        if(res.size() < deep){
            List<Integer> item = new ArrayList<>();
            res.add(item);
        }
        res.get(deep-1).add(node.val);
        checkFun1(node.left,deep);
        checkFun1(node.right,deep);
    }
}

第二种方法bfs实现

/**
 * 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;
 *     }
 * }
 */
class Solution {
      List<List<Integer>> res = new ArrayList<>();
    public List<List<Integer>> levelOrder(TreeNode root) {
        checkFun1(root);
        return res;
 }
    public void checkFun1(TreeNode node){
        if(node == null) return ;
       // Queue<TreeNode> queue = new LinkedArrayList<>();
        Queue<TreeNode> queue = new LinkedList<>();
        queue.offer(node);
        while(!queue.isEmpty()){
            List<Integer> item = new ArrayList<>();
            int n = queue.size();
            while(n > 0){
               // TreeNode temp = queue.pop();
               TreeNode temp = queue.poll();
                item.add(temp.val);
                // if(temp.left != null) queue.add(temp.left);
                // if(temp.right != null) queue.add(temp.right);
                if(temp.left != null) queue.offer(temp.left);
                if(temp.right != null) queue.offer(temp.right);
                n--;
            }
            res.add(item);
        }
 }
}

107. 二叉树的层序遍历 II

/**
 * 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;
 *     }
 * }
 */
class Solution {
    List<List<Integer>> tempres = new ArrayList<>();
    List<List<Integer>> res = new ArrayList<>();
    public List<List<Integer>> levelOrderBottom(TreeNode root) {
        //第一种方法dfs
        findcx(root,0);
        
        for(int i=tempres.size()-1;i>=0;i--){
            res.add(tempres.get(i));
        }
        return res;
    }
    public void findcx(TreeNode node,int deep){
        if(node == null) return;
        deep++;
        if(tempres.size() < deep){
            List<Integer> list = new ArrayList<>();
            tempres.add(list);
        }
        tempres.get(deep-1).add(node.val);
        findcx(node.left,deep);
        findcx(node.right,deep);
    }

}

199. 二叉树的右视图

/**
 * 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;
 *     }
 * }
 */
class Solution {
    List<Integer> res = new ArrayList<>();
    public List<Integer> rightSideView(TreeNode root) {
        //bfs实现
        findcx(root);
        return res;
    }
    public void findcx(TreeNode node){
        if(node == null) return;
        Queue<TreeNode> queue = new LinkedList<>();
        queue.offer(node);
        while(!queue.isEmpty()){
            int n = queue.size();
            for(int i=0;i<n;i++){
                TreeNode tempnode = queue.poll();
                if(tempnode.left != null){
                    queue.add(tempnode.left);
                }
                  if(tempnode.right != null){
                    queue.add(tempnode.right);
                }
                if(i == n-1){
                  res.add(tempnode.val);
                }
            }
            }
        }
}