Fix error in RangeSumOfBST solution

andrei-punko · andrei-punko · commit 224e76c3d58b · 2026-02-06T23:38:03.000+03:00
diff --git a/src/main/java/by/andd3dfx/tree/RangeSumOfBST.java b/src/main/java/by/andd3dfx/tree/RangeSumOfBST.java
@@ -34,10 +34,10 @@ public static int rangeSumBST_usingQueue(TreeNode root, int low, int high) {
         var sum = 0;
         while (!queue.isEmpty()) {
             var element = queue.pop();
-            if (element.left != null && root.val >= low) {
+            if (element.left != null && element.val >= low) {
                 queue.add(element.left);
             }
-            if (element.right != null && root.val <= high) {
+            if (element.right != null && element.val <= high) {
                 queue.add(element.right);
             }
             if (low <= element.val && element.val <= high) {

Original file line number	Diff line number	Diff line change
`@@ -34,10 +34,10 @@ public static int rangeSumBST_usingQueue(TreeNode root, int low, int high) {`
`34`	`34`	`var sum = 0;`
`35`	`35`	`while (!queue.isEmpty()) {`
`36`	`36`	`var element = queue.pop();`
`37`		`- if (element.left != null && root.val >= low) {`
	`37`	`+ if (element.left != null && element.val >= low) {`
`38`	`38`	`queue.add(element.left);`
`39`	`39`	`}`
`40`		`- if (element.right != null && root.val <= high) {`
	`40`	`+ if (element.right != null && element.val <= high) {`
`41`	`41`	`queue.add(element.right);`
`42`	`42`	`}`
`43`	`43`	`if (low <= element.val && element.val <= high) {`