【树】 leetcode_111 _ 二叉树的最小深度
/**
* 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) {
return get_min(root);
}
int get_min(TreeNode *root){
if (root ==nullptr) return 0;
if (root->left == nullptr && root->right!=nullptr){
return 1+get_min(root->right);
}
if (root->right == nullptr && root->left!=nullptr){
return 1+get_min(root->left);
}
int le = get_min(root->left);
int ri = get_min(root->right);
int de = 1+min(le,ri);
return de;
}
};