úÎ ° ¾     A ( is a binary tree and the bounds of its  corresponding interval.  Build the & for the given list. Time: O(n*log n)  Query the * for the specified closed interval. Time:  O(log n)   2Find the sum of the elements in the interval [l, u]. >Find out if any of the elements are True in the interval [l, u]. AFind the greatest common divisor of the elements in the interval  [l, u]. -Concatenate the strings in the interval [l, u]. 'Unwords the words in the interval [l, u].            SegmentTree-0.1Data.SegmentTreeData.SegmentTree.Examples SegmentTreemkTree queryTreeUnwords getUnwordsGCDgetGCD intervalSum intervalAny intervalGCDintervalConcatintervalUnwordsTreeLeafBranch