寻找二叉树的最小深度

【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. 中文题目： 寻找一棵二叉树的最小深度。最小深度是指从根结点到最近

>>阅读原文<<