二叉樹最小深度問題

【問題描述】： 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 給定一個二叉樹，求出它的最小深度，最小深度是從根節點到最

>>阅读原文<<