day 15

最新推荐文章于 2024-05-09 23:02:55 发布

qq_41512555

最新推荐文章于 2024-05-09 23:02:55 发布

阅读量25

点赞数

文章标签： leetcode c++ 算法

本文链接：https://blog.csdn.net/qq_41512555/article/details/127559916

版权

day 15

104. 二叉树的最大深度

/**
 * 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) {
        queue<TreeNode*> q;
        int nums = 0;
        if(!root) return nums;
        q.push(root);
        while(q.size())
        {
            int len = q.size();
            nums++;
            while(len--)
            {
                auto t = q.front();
                q.pop();
                if(t->right) q.push(t->right);
                if(t->left) q.push(t->left);
            }
        }
        return nums;

    }
};

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) {
        queue<TreeNode*> que;
        int sum = 0;
        if(!root) return sum;
        que.push(root);
        while(que.size())
        {
            int len = que.size();
            sum++;
            while(len--)
            {
                auto t = que.front();
                que.pop();
                if(t->left) que.push(t->left);
                if(t->right) que.push(t->right);
                if(!t->left && !t->right) return sum;
            }

        }
        return sum;



    }
};

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) {
        queue<TreeNode*> que;
        int sum = 0;
        if(!root) return sum;
        que.push(root);
        while(que.size())
        {
            int len = que.size();
            while(len--)
            {
                auto t = que.front();
                que.pop();
                sum++;
                if(t->right) que.push(t->right);
                if(t->left) que.push(t->left);

            }
        }
        return sum;



    }
};