Update segment_tree.py

Author: JyotikaJayani-08

data_structures/binary_tree/segment_tree.py

@@ -95,14 +95,15 @@ def query_recursive(self, idx, left, right, a, b):
         q1 = self.query_recursive(self.left(idx), left, mid, a, b)
         q2 = self.query_recursive(self.right(idx), mid + 1, right, a, b)
         return max(q1, q2)
-
+        
     def show_data(self):
         show_list = []
-        for i in range(1, N + 1):
+        for i in range(1, self.N + 1):  
             show_list += [self.query(i, i)]
         print(show_list)
 
 
+
 if __name__ == "__main__":
     A = [1, 2, -4, 7, 3, -5, 6, 11, -20, 9, 14, 15, 5, 2, -8]
     N = 15