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.
{优快云:CODE:630431}
本文探讨如何在给定的二叉树中找到其最小深度,即从根节点到最近叶子节点的最短路径长度。
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.

被折叠的 条评论
为什么被折叠?