leetcode--Minimum Depth of Binary Tree
来源:互联网 发布:java 整形转byte 编辑:程序博客网 时间:2024/05/20 18:18
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.
分类:二叉树
题意:对于指定的二叉树,查找它的最小深度。最小深度是指,从当前节点开始,到其叶子节点的最短路径的长度。
解法1:递归。注意题目要求,最短路径是指当前节点到其叶子节点。所有如果当前节点没有左子树,则最短路径为右子树的最短路径加一;如果当前节点没有右子树,则最短路径为左子树的最短路径加一;如果左右子树都存在,才比较选出最短路径。
解法2:
原文链接http://blog.csdn.net/crazy__chen/article/details/46378969
阅读全文
0 0
- LeetCode: Minimum Depth of Binary Tree
- [Leetcode] Minimum Depth of Binary Tree
- LeetCode : Minimum Depth of Binary Tree
- leetcode 31: Minimum Depth of Binary Tree
- [LeetCode] Minimum Depth of Binary Tree - BFS
- [LeetCode] Minimum Depth of Binary Tree - DFS
- 【leetcode】Minimum Depth of Binary Tree
- LeetCode:Minimum Depth of Binary Tree
- [LeetCode]Minimum Depth of Binary Tree
- [Leetcode]Minimum Depth of Binary Tree
- [leetcode]Minimum Depth of Binary Tree
- Leetcode: Minimum Depth of Binary Tree
- LeetCode-Minimum Depth of Binary Tree
- [leetcode] Minimum Depth of Binary Tree
- LeetCode - Minimum Depth of Binary Tree
- 【Leetcode】Minimum Depth of Binary Tree
- LeetCode | Minimum Depth of Binary Tree
- LeetCode - Minimum Depth of Binary Tree
- L2-013. 红色警报
- Makefile中的双冒号规则
- 矩形相交面积
- 苹果iPhone升级到10.3.3后,4G数据网络经常性断网无法连接???
- zoj 1015(玹图的判定)
- leetcode--Minimum Depth of Binary Tree
- Ubuntu15中安装redis以及redis的简单配置
- 浅谈歌词解析
- socket套接字编程预备知识
- Java中的自定义异常
- 如何在Idea导入myeclipse项目
- HDU 4160 Dolls(二分图匹配+匈牙利算法+最小路径覆盖)
- PTA 5-52 两个有序链表序列的交集 (20分) (单链表)
- String数组 未初始化 为null