Merge pull request #6 from Praddyumn16/patch-3

Created leetcode.com-explore-challenge-card-september-leetcoding-chall…

Author: Ashish-kumar7

leetcode.com-explore-challenge-card-september-leetcoding-challenge-555-week-2-september-8th-september-14th-3453

@@ -0,0 +1,25 @@
+/**
+ * Definition for a binary tree node.
+ * struct TreeNode {
+ *     int val;
+ *     TreeNode *left;
+ *     TreeNode *right;
+ *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
+ *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
+ *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
+ * };
+ */
+class Solution {
+    int sum1(TreeNode* root , int sum){
+        if(!root) return 0;
+        sum = (sum << 1) + root->val;
+        if(!root->right && !root->left) return sum;
+        return sum1(root->left , sum) + sum1(root->right , sum);
+    }
+public:
+    int sumRootToLeaf(TreeNode* root) {
+        return sum1(root , 0);
+    }
+};
+
+