Add more introductory info to segment tree

jxu · web-flow · commit b7df8c8715cc · 2022-07-11T00:22:55.000-04:00
diff --git a/src/data_structures/segment_tree.md b/src/data_structures/segment_tree.md
@@ -6,7 +6,7 @@ e_maxx_link: segment_tree
 
 # Segment Tree
 
-A Segment Tree is a data structure that allows answering range queries over an array effectively, while still being flexible enough to allow modifying the array. 
+A Segment Tree is a data structure that stores information about array intervals as a tree. This allows answering range queries over an array efficiently, while still being flexible enough to allow quick modificiation of the array. 
 This includes finding the sum of consecutive array elements $a[l \dots r]$, or finding the minimum element in a such a range in $O(\log n)$ time. 
 Between answering such queries, the Segment Tree allows modifying the array by replacing one element, or even changing the elements of a whole subsegment (e.g. assigning all elements $a[l \dots r]$ to any value, or adding a value to all element in the subsegment). 
 
