[LeetCode] Minimum Depth of Binary Tree 二叉树的最小深度
2014-10-22 07:27
525 查看
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.
二叉树的经典问题之最小深度问题就是就最短路径的节点个数,还是用深度优先搜索DFS来完成,万能的递归啊。。。请看代码:
求二叉树的最大深度可以参见我的博文:
/article/4901521.html
LeetCode All in One 题目讲解汇总(持续更新中...)
The minimum depth is the number of nodes along the shortest path from the root node down to the nearest leaf node.
二叉树的经典问题之最小深度问题就是就最短路径的节点个数,还是用深度优先搜索DFS来完成,万能的递归啊。。。请看代码:
/** * Definition for binary tree * 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 1; if (root->left == NULL) return minDepth(root->right) + 1; else if (root->right == NULL) return minDepth(root->left) + 1; else return 1 + min(minDepth(root->left), minDepth(root->right)); } };
求二叉树的最大深度可以参见我的博文:
/article/4901521.html
LeetCode All in One 题目讲解汇总(持续更新中...)
相关文章推荐
- [LeetCode-111] Minimum Depth of Binary Tree (二叉树最小深度)
- 【LeetCode-面试算法经典-Java实现】【111-Minimum Depth of Binary Tree(二叉树的最小深度)】
- [LeetCode 111] - 二叉树的最小深度 (Minimum Depth of Binary Tree)
- [Leetcode] The minimum depth of binary tree二叉树的最小深度
- 【LeetCode-面试算法经典-Java实现】【111-Minimum Depth of Binary Tree(二叉树的最小深度)】
- LeetCode Minimum Depth of Binary Tree 最小深度二叉树
- Minimum Depth of Binary Tree 求二叉树最小高度/深度@LeetCode
- Leetcode Minimum Depth of Binary Tree 二叉树最小深度
- [Java代码] [Leetcode] Maximum and Minimum Depth of Binary Tree 二叉树的最小最大深度
- 【LeetCode】Minimum Depth Of Binary Tree二叉树的最小深度 - Easy
- LeetCode:minimum-depth-of-binary-tree(二叉树最小深度)
- [LeetCode] Minimum Depth of Binary Tree 二叉树最小深度
- 【leetcode】Minimum Depth of Binary Tree 二叉树的最小深度 (JAVA)
- LeetCode:111_Minimum Depth of Binary Tree | 二叉树的最小深度 | Easy
- Minimum Depth of Binary Tree 二叉树最小深度
- LeetCode OJ:Minimum Depth of Binary Tree(二叉树的最小深度)
- 【二叉树的递归】01二叉树的最小深度【Minimum Depth of Binary Tree】
- LeetCode OJ 之 Minimum Depth of Binary Tree(二叉树的最小深度)
- Minimum Depth of Binary Tree -- 二叉树的最小深度 DFS 加剪枝
- Minimum Depth of Binary Tree 二叉树的最小深度