Java：求樹最小的深度

問題描述：java Given a binary tree, find its minimum depth.node The minimum depth is the number of nodes along the shortest path from the root node down to the nearest leaf node.ui 這裏要求根節點到最近的葉子節點的距離，spa 定

>>阅读原文<<