1、深度优先搜索做法
/**
* 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==NULL) return 0;
int cnt=0,min=100000;
dfs(root,cnt,min);
return min;
}
void dfs(TreeNode* root,int cnt,int& min)
{
++cnt;
if(root->right==NULL&&root->left==NULL)
{
if(cnt<min) min=cnt;
return ;
}
else
{
if(root->left!=NULL) dfs(root->left,cnt,min);
if(root->right!=NULL) dfs(root->right,cnt,min);
}
}
};