尋找二叉樹的最小深度

【Day 1】 英文題目： Given a binary tree, find its mininum. The minimum depth is the number of nodes along the shortest path from the root node down to the nearest leaf node. 中文題目： 尋找一棵二叉樹的最小深度。最小深度是指從根結點到最近

>>阅读原文<<