leetcode 第111题 Minimum Depth of Binary Tree
来源：互联网 发布：贪心算法汽车加油问题 编辑：程序博客网 时间：2024/06/05 20:37
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，否则返回左子树和右子树中较大的深度+1.
C++实现如下：
/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */class Solution {public: int minDepth(TreeNode* root) { if(root == NULL) return 0; if(root->left != NULL && root->right != NULL) return min(minDepth(root->left),minDepth(root->right)) + 1; else return max(minDepth(root->left),minDepth(root->right)) + 1; }}; 0 0
- leetcode 第111题 Minimum Depth of Binary Tree
- LeetCode(111)Minimum Depth of Binary Tree
- LeetCode: Minimum Depth of Binary Tree [111]
- 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
- 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
- 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
- Leetcode #111 Minimum Depth of Binary Tree
- leetcode 111: Minimum Depth of Binary Tree
- LeetCode 111: Minimum Depth of Binary Tree
- 【原创】LSH和p-stable LSH
- matlab利用描点画平滑曲线
- set_new_handler()总结
- 剑指Offer之 - 二维数组中的查找
- nginx thin 部署rails3程序
- leetcode 第111题 Minimum Depth of Binary Tree
- AngularJs轻松入门（五）过滤器
- Symmetric Tree —— Leetcode
- 多线程断点下载详解
- 二叉搜索树与双向链表
- Android--ADT与SDK之间的关系
- Android仿美团购买悬浮效果
- Unique Binary Search Trees II -- leetcode
- 【bzoj1040】【ZJOI2008】【骑士】
