C++ recursive solution


  • 0
    X
    class Solution {
    public:
        int sumOfLeftLeaves(TreeNode* root) {
          if (!root || (root->left == NULL && root->right == 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.