leetcode, LC1: 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
相关文章
- 1. LeetCode 111 Minimum Depth of Binary Tree
- 2. LeetCode.3.minimum-depth-of-binary-tree
- 3. 【leetcode】Minimum Depth of Binary Tree
- 4. Minimum Depth of Binary Tree [LeetCode]
- 5. LeetCode - Minimum Depth of Binary Tree
- 6. [LeetCode]111.Minimum Depth of Binary Tree
- 7. [Leetcode-Tree]Maximum / Minimum Depth of Binary Tree
- 8. LeetCode刷题Easy篇Minimum Depth of Binary Tree
- 9. LeetCode 111. Minimum Depth of Binary
- 10. 111. Minimum Depth of Binary Tree
- 更多相关文章...
- • XSLT
- • XSLT
- • 算法总结-深度优先算法
- • 算法总结-广度优先算法
相关标签/搜索
每日一句
-
每一个你不满意的现在，都有一个你没有努力的曾经。
欢迎关注本站公众号,获取更多信息
相关文章
- 1. LeetCode 111 Minimum Depth of Binary Tree
- 2. LeetCode.3.minimum-depth-of-binary-tree
- 3. 【leetcode】Minimum Depth of Binary Tree
- 4. Minimum Depth of Binary Tree [LeetCode]
- 5. LeetCode - Minimum Depth of Binary Tree
- 6. [LeetCode]111.Minimum Depth of Binary Tree
- 7. [Leetcode-Tree]Maximum / Minimum Depth of Binary Tree
- 8. LeetCode刷题Easy篇Minimum Depth of Binary Tree
- 9. LeetCode 111. Minimum Depth of Binary
- 10. 111. Minimum Depth of Binary Tree