leetcode ，树，逻辑错误

题目1：Minimum Depth of Binary Tree

题目：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.
Note: A leaf is a node with no children.

Example:
Given binary tree [3,9,20,null,null,15,7],*

    3
   / \
  9  20
    /  \
   15   7

return its minimum depth = 2.

第一次做法，逻辑错误：

class Solution {
    
public:
    int minDepth(TreeNode* root) 
    {
        if(root == NULL)
            return 0;
        else 
            return (1 + min(minDepth(root->left),minDepth(root->right)));     
    }
};
//当input[1,2],输出1，when right answer is 2.