/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
int minDepth(TreeNode* root) {
if(root==NULL)
return 0;
if(root->left==NULL&&root->right==NULL)
return 1;
int left = minDepth(root->left);
int right = minDepth(root->right);
if(root->left==NULL)
return right+1;
if(root->right==NULL)
return left+1;
return min(left,right)+1;
}
};
111 Minimum Depth of Binary Tree
最新推荐文章于 2024-09-14 17:43:25 发布