/**
* 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 minDep;
void getMinDep(TreeNode *curNode,int dep)
{
if(curNode->left==NULL&&curNode->right==NULL)//必须为leafNode才行,有一个节点的不是叶子节点
{
minDep=minDep<dep?minDep:dep;
return;
}
if(curNode->left!=NULL)
getMinDep(curNode->left,dep+1);
if(curNode->right!=NULL)
getMinDep(curNode->right,dep+1);
}
int minDepth(TreeNode *root) {
// Note: The Solution object is instantiated only once and is reused by each test case.
if(root==NULL)
return 0;
minDep=INT_MAX;
getMinDep(root,0);
return minDep+1;//{1,2}应输出2,因为1不是叶子节点
}
};
【leetcode】Minimum Depth of Binary Tree
最新推荐文章于 2023-12-15 03:22:29 发布