/**
* Definition for binary tree
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
int minDepth(TreeNode *root) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
queue<pair<TreeNode *,int> > que;
TreeNode *p;
pair<TreeNode *,int> pr;
int dep=0;
if(root!=NULL)
que.push(make_pair(root,1));
else return 0;
while(!que.empty()){
pr=que.front();
que.pop();
p=pr.first;
dep=pr.second;
if(p->left!=NULL){
que.push(make_pair(p->left,dep+1));
}
if(p->right!=NULL){
que.push(make_pair(p->right,dep+1));
}
if(p->left==NULL&&p->right==NULL){
break;
}
}
return dep;
}
};