思路:
利用之前层序遍历的模板,添加一个计数器,若左子树右子树都为空说明走到了叶子结点,可以返回最小深度。
/**
* 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*>q;
if(root){q.push(root);}
int depth=0;//深度计数器
while(!q.empty()){
int size=q.size();
depth++;//新的一层
for(int i=0;i<size;i++){
TreeNode*cur=q.front();
q.pop();
if(cur->left){q.push(cur->left);}
if(cur->right){q.push(cur->right);}
if(!cur->left&&!cur->right){return depth;}//走到叶子结点,返回最小深度
}
}
return depth;
}
};