代码随想录算法训练营第十四天|LeetCode 104，111，222

目录

LeetCode 104.二叉树的最大深度

LeetCode 111.二叉树的最小深度 

LeetCode 222.完全二叉树的节点个数 

---

LeetCode 104.二叉树的最大深度

文章讲解：代码随想录

视频讲解：二叉树的高度和深度有啥区别？究竟用什么遍历顺序？很多录友搞不懂 | LeetCode：104.二叉树的最大深度_哔哩哔哩_bilibili

力扣题目：LeetCode 104.二叉树的最大深度

 

代码如下（Java）：

/**
 * 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 {
    public int maxDepth(TreeNode root) {

        if(root == null)    return 0;

        int leftDepth = maxDepth(root.left);
        int rightDepth = maxDepth(root.right);

        return Math.max(leftDepth, rightDepth) + 1;
    }
}

---

LeetCode 111.二叉树的最小深度 

文章讲解：代码随想录

视频讲解：看起来好像做过，一写就错！ | LeetCode：111.二叉树的最小深度_哔哩哔哩_bilibili

力扣题目：LeetCode 111. 二叉树的最小深度

 

 代码如下（Java）：

/**
 * 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 {

    public int minDepth(TreeNode root) {

        if(root == null)    return 0;

        int leftDepth = minDepth(root.left);
        int rightDepth = minDepth(root.right);

        if(root.left == null)   return rightDepth + 1;
        if(root.right == null)  return leftDepth + 1;

        return Math.min(leftDepth, rightDepth) + 1;
    }
}

---

LeetCode 222.完全二叉树的节点个数 

文章讲解：代码随想录

视频讲解：要理解普通二叉树和完全二叉树的区别！ | LeetCode：222.完全二叉树节点的数量_哔哩哔哩_bilibili

力扣题目：LeetCode 222. 完全二叉树的节点个数

代码如下（Java）：递归（后序递归）

/**
 * 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 {
    public int countNodes(TreeNode root) {

        if(root == null){
            return 0;
        }

        return countNodes(root.left) + countNodes(root.right) + 1;
    }
}

代码如下（Java）：层序遍历

/**
 * 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 {
    public int countNodes(TreeNode root) {

        if(root == null)    return 0;

        Queue<TreeNode> queue = new LinkedList<>();
        queue.offer(root);
        int result = 0;

        while(!queue.isEmpty()){
            
            int size = queue.size();

            while(size-- > 0){

                TreeNode cur = queue.poll();
                result++;

                if(cur.left != null)    queue.offer(cur.left);
                if(cur.right != null)   queue.offer(cur.right);
            }
        }

        return result;
    }
}