class Solution {
public:
int minDepth(TreeNode* root) {
queue<TreeNode*>que;
if(root!=NULL)que.push(root);
int sum=0;
while(!que.empty()){
int size=que.size();
for(int i=0;i<size;i++){
TreeNode *node=que.front();
que.pop();
if(node->left)que.push(node->left);
if(node->right)que.push(node->right);
if(node->left==NULL&&node->right==NULL){
return sum+1;
}
}
sum++;
}
return sum;
}
};
ac一次