题目:
https://leetcode-cn.com/problems/minimum-depth-of-binary-tree/
来源:LeetCode
代码:
/**
* 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) return 0;
queue<TreeNode*> q;
q.push(root);
int floor = 0;
while(!q.empty()){
++floor;
int len= q.size();
while(len--){
TreeNode *node = q.front();
q.pop();
if(!node->left && !node->right) goto A;
if(node->left) q.push(node->left);
if(node->right) q.push(node->right);
}
}
A:
return floor;
}
};
时间复杂度:O(N)
空间复杂度:O(N)