问题描述:
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.
问题分析:求解一棵二叉树的最小深度,可采用深度遍历的方法。
注意:这里存在左右子树为空的状态,需要单独判断处理。
过程详见代码:
/**
* 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->right == NULL) return minDepth(root->left) + 1;
if(root->left == NULL) return minDepth(root->right) + 1;
return min(minDepth(root->left) + 1,minDepth(root->right) + 1);
}
};