代码随想录刷题第16天

最新推荐文章于 2024-09-27 15:30:00 发布

气氛组阿宇

最新推荐文章于 2024-09-27 15:30:00 发布

阅读量40

点赞数

文章标签： leetcode 算法数据结构

本文链接：https://blog.csdn.net/Bi11y/article/details/128962561

版权

代码随想录刷题第16天

二叉树的最大深度

/**
 * 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 transation(TreeNode* root){
        if(root==nullptr) return 0;
        int left_num =transation(root->left);
        int right_num = transation(root->right);
        int result = max(left_num,right_num ) + 1;
        return result;

    }
    int maxDepth(TreeNode* root) {
     int final =   transation(root);
     return final;
    }
};

二叉树的最小深度

/**
 * 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 transation(TreeNode* root){
        if(root == nullptr) return 0;
        int left = transation(root->left);
        int right = transation(root->right);

        if(root->left == nullptr && root->right != nullptr) return 1 + right;
        if(root->right == nullptr&& root->left != nullptr) return 1 + left;

        int result =1+ min(right,left );
        return result;

    }
    int minDepth(TreeNode* root) {
        return transation(root);
        
    }
};

完全二叉树的节点个数

/**
 * 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 transation(TreeNode* root){
        if(root == nullptr) return 0;
        int left = transation(root->left);
        int right = transation(root->right);
        int result = 1 + left + right;
        return result;
    }
    int countNodes(TreeNode* root) {
        return transation(root);
    }
};