Given a binary tree, find its minimum depth.
The minimum depth is the number of nodes along the shortest path from the root node down to the nearest leaf node.
思路:递归实现。若左右子树均不空,则返回左子树和右子树中较小的深度+1,否则返回左子树和右子树中较大的深度+1.
C++实现如下:
/**
* 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 min(minDepth(root->left),minDepth(root->right)) + 1;
else
return max(minDepth(root->left),minDepth(root->right)) + 1;
}
};