http://oj.leetcode.com/problems/minimum-depth-of-binary-tree/
这道题用来求二叉树的最小深度,注意有一下两点:
- The minimum depth is defined as the number of nodes along the shortest path from the root node down to the nearest leaf node.
- 如果当前深度(current_depth) 已经大于最小深度(min_depth)时,直接return,可以节省很多时间(BFS)
AC:BFS算法,略复杂,但节省时间
/**
* 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) {
int min_depth = 99999;
findLightDepth(root, 1, min_depth);
return min_depth==99999 ? 0 : min_depth;
}
void findLightDepth(TreeNode *root, int current_depth, int &min_depth) {
if(root == NULL || current_depth > min_depth) return;
if(root->left == NULL && root->right == NULL && min_depth > current_depth) {
min_depth = current_depth;
}
findLightDepth(root->left, current_depth+1, min_depth);
findLightDepth(root->right, current_depth+1, min_depth);
}
};
AC:DFS算法,把所有的节点遍历了一遍,时间上有浪费,但实现简单
第20,21行是为了防止一子节点为空,另一子节点非空的情况,因为对于一个叶子节点来讲,它的两个子节点必须都为空。
/**
* 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) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
if (root == NULL) return 0;
int left = minDepth(root->left) + 1;
int right = minDepth(root->right) + 1;
// 叶子节点
if (left == 1 || right == 1)
return left > right ? left : right;
return left < right ? left : right;
}
};