給定一個二叉樹，找到它的最小深度。

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.node 給定一個二叉樹，找到它的最小深度。最小深度是根節點到最近葉子節點路徑上的節

>>阅读原文<<