代码随想录算法训练营第十六天 | 104.二叉树的最大深度、559.n叉树的最大深度、 111.二叉树的最小深度、222.完全二叉树的节点个数

104.二叉树的最大深度

题解及想法

递归法

/**
 * 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 left = maxDepth(root.left);
        int right = maxDepth(root.right);
        return left > right ? left + 1 : right + 1;
    }
}

559.n叉树的最大深度

题解及想法

和二叉树类似

/*
// Definition for a Node.
class Node {
    public int val;
    public List<Node> children;

    public Node() {}

    public Node(int _val) {
        val = _val;
    }

    public Node(int _val, List<Node> _children) {
        val = _val;
        children = _children;
    }
};
*/

class Solution {
    public int maxDepth(Node root) {
        if(root == null){
            return 0;
        }
        int dep = 0;
        if (root.children != null){
            for (Node child : root.children){
                dep = Math.max(dep, maxDepth(child));
            }
        }
        return dep + 1; //中节点
    }
}

二叉树的最小深度

题解及想法

最小深度是从根节点到最近叶子节点的最短路径上的节点数量

所以需要用if (root.left == null)，if (root.right == null)来判断是否是叶子节点

/**
 * 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;
        }
        // 左右结点都不为null
        return Math.min(leftDepth, rightDepth) + 1;
    }
}

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

题解及想法

/**
 * 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;
        TreeNode left = root.left,right = root.right;
        int leftNum = 0, rightNum = 0;
        while(left != null){
            left = left.left;
            leftNum++;
        }
        while(right != null){
            right = right.right;
            rightNum++;
        }
        if(rightNum == leftNum){
            return (2 << leftNum) - 1; // 注意(2<<1) 相当于2^2，所以leftDepth初始为0, 2^n - 1为节点公式
        }
        return countNodes(root.left) + countNodes(root.right) + 1;
    }
}