#include <iostream>
#include <algorithm>
#include "string"
#include "vector"
#include "stack"
#include "set"
#include "queue"
using namespace std;
struct TreeNode {
int val;
TreeNode *left;
TreeNode *right;
TreeNode(int x) : val(x), left(NULL), right(NULL) {}
};
int minDepth(TreeNode *root)
{
if (root == NULL)
{
return 0;
}
if (root->left == NULL)
{
return 1 + minDepth(root->right);
}
else if (root->right == NULL)
{
return 1 + minDepth(root->left);
}
else
{
return 1 + min(minDepth(root->left), minDepth(root->right));
}
}
int main()
{
TreeNode t1 = TreeNode(3);
TreeNode t2 = TreeNode(9);
TreeNode t3 = TreeNode(20);
TreeNode t4 = TreeNode(15);
TreeNode t5 = TreeNode(7);
t1.left = &t2; t1.right = &t3;
t3.left = &t4; t3.right = &t5;
cout<<minDepth(&t1);
system("pause");
return 0;
}