1- class Node () :
1+ class Node :
22 def __init__ (self , start : int , end : int ) -> None :
33 # Initializes a segment tree node with start and end indices
44 self .start = start
@@ -7,7 +7,7 @@ def __init__(self, start: int, end: int) -> None:
77 self .left = None
88 self .right = None
99
10- class SegmentTree () :
10+ class SegmentTree :
1111 def __init__ (self , nums : list [int ], mode : str = 'max' ) -> None :
1212 """
1313 Initializes the Segment Tree.
@@ -103,14 +103,9 @@ def query(self, node: Node, start_index: int, end_index: int, start: int, end: i
103103 else :
104104 # Range spans both children
105105 if self .mode == "max" :
106- return max (
107- self .query (node .left , start_index , end_index , start , mid ),
108- self .query (node .right , start_index , end_index , mid + 1 , end ),
109- )
106+ return max (self .query (node .left , start_index , end_index , start , mid ), self .query (node .right , start_index , end_index , mid + 1 , end ))
110107 else :
111- return self .query (
112- node .left , start_index , end_index , start , mid
113- ) + self .query (node .right , start_index , end_index , mid + 1 , end )
108+ return self .query (node .left , start_index , end_index , start , mid ) + self .query (node .right , start_index , end_index , mid + 1 , end )
114109
115110 def update (self , index : int , new_value : int ) -> int :
116111 """
0 commit comments