[LeetCode] Minimum Depth of Binary Tree 根到叶的最短深度

声明：原题目转载自LeetCode，解答部分为原创

Problem：

      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.

Solution：

        思路：寻找根到叶的最短路径，根据贪心算法的思想，对从根开始的每一个结点，假定已经找到叶到该节点的子节点的最短路径，则叶到该节点的最短路径为 ”原最短路径 + 1”

        代码如下：

#include<iostream>
using namespace std;

//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 1;
		
		if(root->left == NULL)
		    return 1 + minDepth(root->right);
		if(root->right == NULL)
		    return 1 + minDepth(root->left);
		return 1 + min(minDepth(root->left), minDepth(root->right));
	}
};

int main()
{
	TreeNode * tree   = new TreeNode(0);
	TreeNode * node_0 = new TreeNode(1);
	TreeNode * node_1 = new TreeNode(2);
	
	tree->left = node_0;
	node_0->right = node_1;
	
	Solution text;
	cout << text.minDepth(tree) << endl;
	return 0;
}