Easy-题目37:111. Minimum Depth of Binary Tree
来源:互联网 发布:微商城开发费用 知乎 编辑:程序博客网 时间:2024/06/03 07:48
题目原文:
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) 空树最小深度是0;
(2) 一边子树为空的情况下,最小深度为1+非空子树最小深度;
(3) 两边均有子树的情况下,最小深度为1+左右子树最小深度的最小值。
据此很容易写出递归算法。
源码:(language:c)
int minDepth(struct TreeNode* root) { if(!root) return 0; else if(!root->right) return 1+minDepth(root->left); else if(!root->left) return 1+minDepth(root->right); else return 1+min(minDepth(root->left),minDepth(root->right));}int min(int a,int b) { return a<b?a:b;}
成绩:
4ms,beats 37.3%,众数4ms,62.7%.
cmershen的碎碎念:
第二和第三个if不能省略,否则对一边子树为空的情况则返回1.(根节点到空树)。
0 0
- Easy-题目37:111. Minimum Depth of Binary Tree
- 111.Minimum Depth of Binary Tree(Tree-Easy)
- 111. Minimum Depth of Binary Tree [easy] (Python)
- Leetcode 111. Minimum Depth of Binary Tree (Easy) (cpp)
- LeetCode解题报告 111. Minimum Depth of Binary Tree [easy]
- [Leetcode 104, Easy] Minimum (Maximum) Depth of Binary Tree
- Minimum Depth of Binary Tree——LeetCode(Easy)
- Minimum Depth of Binary Tree----easy
- [Leetcode 111, Easy] Minimum Depth of Binary Tree
- <LeetCode><Easy> 111 Minimum Depth of Binary Tree
- 【Leetcode-easy-111】Minimum Depth of Binary Tree
- LeetCode-Easy刷题(25) Minimum Depth of Binary Tree
- LeetCode 111. Minimum Depth of Binary Tree
- [LeetCode]111.Minimum Depth of Binary Tree
- 【LeetCode】111.Minimum Depth of Binary Tree
- [Leetcode] 111. Minimum Depth of Binary Tree
- 111.Minimum Depth of Binary Tree
- 111. Minimum Depth of Binary Tree
- Hibernate XX is not Mapped问题笔记
- .m 文件与.mm文件的区别
- Easy-题目36:112. Path Sum
- Android学习记录(十九)-简单的动画清除
- 反转链表17
- Easy-题目37:111. Minimum Depth of Binary Tree
- poj 2286
- 类与类之间的关系
- 常用docker镜像安装
- MyEclipse10配置自动补全/字体大小/行号/背景颜色
- Easy-题目38:160. Intersection of Two Linked Lists
- 偏好设置
- 总结
- Easy-题目39:88. Merge Sorted Array