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 binary tree
* 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;
int dep=100000000; //设置一个较大的数值的目的是 为了第一次获得叶子节点的时候能够被更新
dfs(root,dep,1);
return dep;
}
private:
void dfs(TreeNode *root,int & dep,int cnt_depth)
{
if(root==NULL)
return ;
if((root->left==NULL)&&(root->right==NULL)&&(dep>cnt_depth))
dep=cnt_depth;
dfs(root->left,dep,cnt_depth+1);
dfs(root->right,dep,cnt_depth+1);
}
};