题目描述：
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.
题目大意：
给定一棵二叉树，计算其最小深度。
最小深度是指从根节点出发到达最近的叶子节点所需要经过的节点个数。
解题思路：
DFS或者BFS均可，详见代码。
档案日期2015的47
2015年11月23日 - 2015年11月29日
[LeetCode]Minimum Depth of Binary Tree
[LeetCode]Minimum Height Trees
作者是
发布于
在
LeetCode.
题目描述：
For a undirected graph with tree characteristics, we can choose any node as the root. The result graph is then a rooted tree. Among all possible rooted trees, those with minimum height are called minimum height trees (MHTs). Given ...
[LeetCode]Best Time to Buy and Sell Stock with Cooldown
作者是
发布于
在
LeetCode.
题目描述：
Say you have an array for which the i-th element is the price of a given stock on day i.
Design an algorithm to find the maximum profit. You may complete as many transactions as you like (ie, buy ...