fixed elif statement

Author: xxx595588

data_structures/binary_tree/segment_tree_node.py

@@ -100,12 +100,10 @@ def query(self, node: Node, start_index: int, end_index: int, start: int, end: i
         elif start_index > mid:
             # Entire range is in the right child
             return self.query(node.right, start_index, end_index, mid + 1, end)
+        elif self.mode == 'max':
+            return max(self.query(node.left, start_index, end_index, start, mid), self.query(node.right, start_index, end_index, mid + 1, end))
         else:
-            # Range spans both children
-            if self.mode == 'max':
-                return max(self.query(node.left, start_index, end_index, start, mid), self.query(node.right, start_index, end_index, mid + 1, end))
-            else:
-                return self.query(node.left, start_index, end_index, start, mid) + self.query(node.right, start_index, end_index, mid + 1, end)
+            return self.query(node.left, start_index, end_index, start, mid) + self.query(node.right, start_index, end_index, mid + 1, end)
 
     def update(self, index: int, new_value: int) -> int:
         """