代码随想录day16 补

104 二叉树最大深度

class Solution {
public:
    int getdepth(TreeNode* node) {
        if (node == NULL) return 0;
        int leftdepth = getdepth(node->left);       
        int rightdepth = getdepth(node->right);     
        int depth = 1 + max(leftdepth, rightdepth); 
        return depth;
    }
    int maxDepth(TreeNode* root) {
        return getdepth(root);
    }
};```
迭代法

```cpp
class Solution {
public:
    int maxDepth(TreeNode* root) {
        if(root == nullptr) return 0;
        queue<TreeNode*> que;
        int depth = 0;
        que.push(root);
        while(!que.empty()){
            int size = que.size();
            depth++;
            for(int i = 0;i < size;++i){
                auto it = que.front();
                que.pop();
                if(it-> left) que.push(it->left);
                if(it-> right) que.push(it->right);
            }
        }
        return depth;
    }
};

111二叉树最小深度

class Solution {
public:
    int minDepth(TreeNode* root) {
        if(root == nullptr) return 0;
        queue<TreeNode*> que;
        int depth = 0;
        que.push(root);
        while(!que.empty()){
            int size = que.size();
            depth++;
            for(int i = 0;i < size;++i){
                auto it = que.front();
                que.pop();
                if(it-> left) que.push(it->left);
                if(it-> right) que.push(it->right);
                if(!it->left && !it->right){
                    return depth;
                }
            }
        }
        return depth;
    }
};

222 完全二叉树的节点个数

class Solution {
public:
    int getNum(TreeNode* cur){
        if(cur == nullptr) return 0;
        int leftNum = getNum(cur->left);  
        int rightNum = getNum(cur->right);   
        int treeNum = leftNum + rightNum + 1;     
        return treeNum;
    }
    int countNodes(TreeNode* root) {
        return getNum(root);
    }
};