给定一个二叉树，找到它的最小深度。

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 给定一个二叉树，找到它的最小深度。最小深度是根节点到最近叶子节点路径上的节

>>阅读原文<<