Segment tree query illustration
Generally, a segment tree's nodes would contain elements that are comparable, which contain the absolute max/min of its children. The algorithm operates by requiring the max/min or a range. It starts on the root and splits into a right search and/or a left search recursively until it reaches either cases:
If you want to learn more about it, here is a good source.