Create 1038. Binary Search Tree to Greater Sum Tree (#512)

Author: Chayandas07

1038. Binary Search Tree to Greater Sum Tree

@@ -0,0 +1,19 @@
+class Solution {
+private:
+    int sum = 0;
+
+    void traverse(TreeNode* root) {
+        if (root) {
+            traverse(root->right);  // Traverse the right subtree
+            sum += root->val;  // Update the sum
+            root->val = sum;  // Update the current node's value
+            traverse(root->left);  // Traverse the left subtree
+        }
+    }
+
+public:
+    TreeNode* bstToGst(TreeNode* root) {
+        traverse(root);
+        return root;
+    }
+};