LeetCode-Minimum Depth of Binary Tree

//注意{1，2}是2。。。挨坑了

int depth(TreeNode *root, int sum)
{

    if(root->left==NULL && root->right==NULL)
        return sum;
    
    if(root->left==NULL)
        return depth(root->right,sum+1);
    if(root->right==NULL)
        return depth(root->left,sum+1);
    
    int left=0;
    int right=0;
    
    if(root->left!=NULL)
        left=depth(root->left,sum+1);
    if(root->right!=NULL)
        right=depth(root->right,sum+1);
    
    return left>right?right:left;
}

int minDepth(TreeNode *root)
{
    if(root==NULL)
        return 0;
    return depth(root, 1);
}