找出二叉樹的最小深度

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 ）寫出一個帶形參的方法，明白方法實現的功能。好比

>>阅读原文<<