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 定

>>阅读原文<<