/**
* 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:
//最小深度是从根节点到最近叶子节点的最短路径上的节点数量
//叶子节点:左右孩子都为NULL
int getdepth(TreeNode* node){
if (node == NULL){
return 0;
}
int rdepth = getdepth(node->right);
int ldepth = getdepth(node->left);
//一直查到最深的时候,有分支的最小数
if (node->right == NULL && node->left != NULL){
return 1 + ldepth;
}
if (node->right !=NULL && node->left == NULL){
return 1 + rdepth;
}
int mindepth = 1 + min(rdepth, ldepth);//有1个根节点需要算进去
return mindepth;
}
int minDepth(TreeNode* root) {
return getdepth(root);
}
};