给定一个二叉树,找出其最小深度。
最小深度是从根节点到最近叶子节点的最短路径上的节点数量。
说明:叶子节点是指没有子节点的节点。
示例 1:
输入:root = [3,9,20,null,null,15,7]
输出:2
示例 2:
输入:root = [2,null,3,null,4,null,5,null,6]
输出:5
提示:
-
树中节点数的范围在 [0, 105] 内
-
-1000 <= Node.val <= 1000
迭代法(层序):
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
* };
*/
class Solution {
public:
int minDepth(TreeNode* root) {
if(root==NULL)return 0;
int depth=0;
queue<TreeNode*>que;
que.push(root);
while(!que.empty()){
int size=que.size();
depth++;
for(int i=0;i<size;i++){
TreeNode* node=que.front();
que.pop();
if(node->left)que.push(node->left);
if(node->right)que.push(node->right);
if(!node->left&&!node->right)return depth;
}
}
return depth;
}
};
递归版:
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
* };
*/
class Solution {
public:
int getdepth(TreeNode* node){
if(node==nullptr)return 0;
int leftDepth=getdepth(node->left);
int rightDepth=getdepth(node->right);
if(node->left==NULL&&node->right!=NULL){
return 1+rightDepth;
}
if(node->left!=NULL&&node->right==NULL){
return 1+leftDepth;
}
int depth=1+min(leftDepth,rightDepth);
return depth;
}
int minDepth(TreeNode* root) {
return getdepth(root);
}
};
递归版(化简):
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
* };
*/
class Solution {
public:
int minDepth(TreeNode* root) {
if(root==NULL)return 0;
if(root->left==NULL&&root->right!=NULL)return 1+minDepth(root->right);
if(root->left!=NULL&&root->right==NULL)return 1+minDepth(root->left);
return 1+min(minDepth(root->left),minDepth(root->right));
}
};