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

104.二叉树的最大深度 （优先掌握递归）Maximum Depth of Binary Tree - LeetCode

后序遍历

根节点的高度就是这颗树的最大深度。

int getHeight(node)

        if (node == null) return 0;

     左   int leftHeight = getHeight(node.left);

     右  int rightHeight = getHeight(node,right);

    中  int height = Math.max(leftHeight, rightHeight) + 1

        return height;

/**
 * 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);
        int height = Math.max(left, right) + 1;
        return height;
    }
}

559.n叉树的最大深度 Maximum Depth of N-ary Tree - LeetCode

/*
// 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 depth = 0;

        for (Node n : root.children) {
            depth = Math.max(depth, maxDepth(n));
        }

        return depth + 1;
    }
}

111.二叉树的最小深度 （优先掌握递归） Minimum Depth of Binary Tree - LeetCode

int getHeight(TreeNode root)

        if (root == null) return 0;

        int left = getHeight(root.left);//左子树最小高度

        int right = getHeight(root.right);

        if (root.left == null && root.right != null)

                return right+ 1;

        if (root.left != null && root.right == null)

                return left + 1;

        int res = Math.min(left, right) + 1;

        return res;

        

/**
 * 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 left = minDepth(root.left);
        int right = minDepth(root.right);
        if (root.left == null && root.right != null) {
            return 1 + right;
        }
        if (root.left != null && root.right == null) {
            return 1 + left;
        }
        int res = Math.min(left, right) + 1;
        return res;
    }
}

 222.完全二叉树的节点个数（优先掌握递归）Count Complete Tree Nodes - LeetCode

后序遍历

int getNode(TreeNode root)

        if (root == null) return 0;

 左       left = getNode(root.left);

 右      right = getNode(root.right);

 中      sum = left + right +1；

完全二叉树：Count Complete Tree Nodes - LeetCode

int getNode(root)

        if (root == null) return 0;

        left = root.left;

        right = root.right;

        leftH = 0;

        rightH = 0;

        while(left)

                left = left.left;

                leftH++;

        while(right)

                right = right.right;

                rightH++;

        if (leftH == rightH) return (2<<leftH) + 1;

感觉这个方法不是很懂，还是按普通二叉树解法写的

/**
 * 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;
    }
}