From 05253650d01a7032fe9941209fd7bca5b2959550 Mon Sep 17 00:00:00 2001
From: aadil42 <77232799+aadil42@users.noreply.github.com>
Date: Tue, 15 Oct 2024 20:50:17 +0530
Subject: [PATCH 1/2] Create 0938-range-sum-of-bst.js

---
 javascript/0938-range-sum-of-bst.js | 31 +++++++++++++++++++++++++++++
 1 file changed, 31 insertions(+)
 create mode 100644 javascript/0938-range-sum-of-bst.js

diff --git a/javascript/0938-range-sum-of-bst.js b/javascript/0938-range-sum-of-bst.js
new file mode 100644
index 000000000..04f2a3323
--- /dev/null
+++ b/javascript/0938-range-sum-of-bst.js
@@ -0,0 +1,31 @@
+/**
+ * Definition for a binary tree node.
+ * function TreeNode(val, left, right) {
+ *     this.val = (val===undefined ? 0 : val)
+ *     this.left = (left===undefined ? null : left)
+ *     this.right = (right===undefined ? null : right)
+ * }
+ */
+/**
+ * DFS | Recursion
+ * Time O(n)  | Space O(n)
+ * https://leetcode.com/problems/range-sum-of-bst
+ * 
+ * @param {TreeNode} root
+ * @param {number} low
+ * @param {number} high
+ * @return {number}
+ */
+var rangeSumBST = function(root, low, high) {
+    
+    let total = 0;
+
+    const dfs = (node) => {
+        if(!node) return;
+        if(node.val >= low && node.val <= high) total += node.val;
+        dfs(node.left);
+        dfs(node.right);
+    }
+    dfs(root);
+    return total;
+};

From 696cd696274dce0291f7679506f7aa7b12aa9172 Mon Sep 17 00:00:00 2001
From: Yaseen Khan <kyaseen49@yahoo.com>
Date: Tue, 15 Oct 2024 19:35:22 -0700
Subject: [PATCH 2/2] Added Spacing

---
 javascript/0938-range-sum-of-bst.js | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/javascript/0938-range-sum-of-bst.js b/javascript/0938-range-sum-of-bst.js
index 04f2a3323..7fa56e034 100644
--- a/javascript/0938-range-sum-of-bst.js
+++ b/javascript/0938-range-sum-of-bst.js
@@ -21,8 +21,8 @@ var rangeSumBST = function(root, low, high) {
     let total = 0;
 
     const dfs = (node) => {
-        if(!node) return;
-        if(node.val >= low && node.val <= high) total += node.val;
+        if (!node) return;
+        if (node.val >= low && node.val <= high) total += node.val;
         dfs(node.left);
         dfs(node.right);
     }