LeetCode-Exercises/111MinimumDepthofBinaryTree.cpp at main · EricluvPython/LeetCode-Exercises · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
/**
 * 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;}
        queue<TreeNode*> q;
        q.push(root);
        int ans = 1;
        while (!q.empty()) {
            int s = q.size();
            for(int i=0;i<s;++i){
                TreeNode* temp = q.front();
                q.pop();
                if(temp->left==NULL and temp->right==NULL){return ans;}
                if(temp->left){q.push(temp->left);}
                if(temp->right){q.push(temp->right);}
            }
            ans++;
        }
        return ans;
    }
};