Minimum Depth of Binary Tree

int minDepth(TreeNode *root)
{
return minDepth(root, false);
}
int minDepth(TreeNode *root, bool hasbrothers)
{
if (root == nullptr)return hasbrothers ? INT_MAX : 0;

return 1 + min(minDepth(root->left, root->right != nullptr),
minDepth(root->right, root->left != nullptr));

}