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.
见程序注释
| Name | Name | Last commit date | ||
|---|---|---|---|---|
parent directory.. | ||||
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.
见程序注释