Minimum Depth of Binary Tree.txt

/**
 * 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 minDepth(TreeNode *root) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        if (root == NULL)
            return 0;
        int l = minDepth(root->left);
        int r = minDepth(root->right);
        return (l == r)?(l+1):min(l, r)?min(l, r)+1:max(l, r)+1;
        
    }
};