思路:最小深度是根节点到最近叶子节点的高度。
题解c++:
/**
* 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;
if(root->left==NULL&&root->right!=NULL)
return 1+minDepth(root->right);
if(root->left!=NULL&&root->right==NULL)
return 1+minDepth(root->left);
//if(root->left!=NULL&&root->right!=NULL)
return 1+min(minDepth(root->left),minDepth(root->right));
}
};