Recursion way in five line codes(C++)


  • 0
    J
    class Solution {
    public:
    int minDepth(TreeNode* root) {
        if(root==NULL)return 0;
        else if(root->left==NULL&&root->right==NULL)return 1;
        else if(root->left==NULL)return minDepth(root->right)+1;
        else if(root->right==NULL)return minDepth(root->left)+1;
        else 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.