leetCode——minimum-depth-of-binary-tree(二叉树的最小深度)
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.
深度优先遍历(递归)
/**
* Definition for bi...
原创
2018-08-28 15:42:55 ·
158 阅读 ·
0 评论