找出二叉树的最小深度

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.java 写递归步骤：   （ 1 ）写出一个带形参的方法，明白方法实现的功能。好比

>>阅读原文<<