104. 二叉树的最大深度 + 559. N 叉树的最大深度+ 111. 二叉树的最小深度 + 222. 完全二叉树的节点个数-CSDN博客

本文链接：https://blog.csdn.net/Wang_Dechang/article/details/129825104

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), 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 res = max(left , right) + 1;
        return res;
    }
};

559. N 叉树的最大深度

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

    Node() {}

    Node(int _val) {
        val = _val;
    }

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

class Solution {
public:
    int maxDepth(Node* root) {
        if(root == NULL) return 0;
        int res = 0;
        for(int i = 0 ; i < root->children.size() ; i++)
        {
            res = max(res , maxDepth(root->children[i]));
        }
        res++;
        return res;
    }
};

后序遍历

111. 二叉树的最小深度

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
public:
    
    int minDepth(TreeNode* root) {
        if(root == NULL) return 0; 
        if(root -> left == NULL && root -> right == NULL ) return 1;
        int left = INT_MAX;
        int right = INT_MAX;
        if(root -> left != NULL )left = minDepth(root -> left);
        if(root -> right != NULL )right = minDepth(root -> right);
        int res = min (left , right) + 1;
        return res;  
    }
};

其实相当于分类讨论了

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

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
public:
    int countNodes(TreeNode* root) {
        if(root == NULL) return 0;
        TreeNode* left = root -> left;
        TreeNode* right = root -> right;
        int rightdepth = 0;
        int leftdepth = 0;
        while(left)
        {
            left = left -> left;
            leftdepth++;
        }
        while(right)
        {
            right = right -> right;
            rightdepth++;
        }
        if(leftdepth == rightdepth) return (2 << rightdepth )- 1;
        return countNodes(root -> left) + countNodes(root -> right) + 1;


    }
};