Simple and most efficient 5 line C++ code


  • 0
    Y
    class Solution {
    public:
        int sumOfLeftLeaves(TreeNode* root) {
            if(root == NULL)
                return 0;
         
            if(root->left!=NULL && root->left->left==NULL && root->left->right==NULL)
                return root->left->val + sumOfLeftLeaves(root->right);
            
            return sumOfLeftLeaves(root->left) + sumOfLeftLeaves(root->right);
        }
    };
    

Log in to reply
 

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