A 12ms Accepted Solution


  • 0
    Y
    class Solution {
    public:
        int minDepth(TreeNode* root) {
            if(!root) return 0;
            if(!root->left) return (minDepth(root->right) + 1);
            if(!root->right) return (minDepth(root->left) + 1);
            return (min(minDepth(root->left),minDepth(root->right)) + 1);
        }
    };

Log in to reply
 

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.