LeetCode.3.minimum-depth-of-binary-tree

題目：求給定二叉樹的最小深度。最小深度是指樹的根結點到最近葉子結點的最短路徑上結點的數量。java 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 le

>>阅读原文<<