Minimum Depth of Binary Tree
Total Accepted: 84968 Total Submissions: 285784 Difficulty: Easy
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).方法二则是通过递归调用,找出最小值。
/**
* 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) {
queue<TreeNode*> que;
if(root==NULL){
return 0;
}
TreeNode* p;
que.push(root);
int len=1;
while(!que.empty()){
int size=que.size();
while(size--){
p=que.front();
que.pop();
if(p->left==NULL&&p->right==NULL){
return len;
}
if(p->left!=NULL){
que.push(p->left);
}
if(p->right!=NULL){
que.push(p->right);
}
}
len++;
}
}
};
/**
* 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 1;
}
if(root->left==NULL){
return 1+minDepth(root->right);
}else if(root->right==NULL){
return 1+minDepth(root->left);
}
return 1+min(minDepth(root->left),minDepth(root->right));
}
};