TheAlgorithms
diff --git a/‎Data-Structures/Tree/SegmentTree.js‎
Lines changed: 0 additions & 1 deletion b/‎Data-Structures/Tree/SegmentTree.js‎
Lines changed: 0 additions & 1 deletion
@@ -41,7 +41,6 @@ class SegmentTree {
     // tree's root node will contain all leaf node's sum
     for (let i = size - 1; i > 0; --i) {
       // current node's value is the sum of left child, right child
-      // tree[i] = tree[i * 2] + tree[i * 2 + 1]
       tree[i] = tree[i * 2] + tree[i * 2 + 1]
     }
   }
Original file line number	Diff line number	Diff line change
@@ -41,7 +41,6 @@ class SegmentTree {
41	41	// tree's root node will contain all leaf node's sum
42	42	for (let i = size - 1; i > 0; --i) {
43	43	// current node's value is the sum of left child, right child
44		- // tree[i] = tree[i * 2] + tree[i * 2 + 1]
45	44	tree[i] = tree[i * 2] + tree[i * 2 + 1]
46	45	}
47	46	}