A segment tree for a set I of n intervals uses O(n log n) storage and can be built in O(n log n) time. Segment trees support searching for all the intervals that contain a query point in O(log n + k), k being the number of retrieved intervals or segments.
Read full article from Java Program to Implement Segment Tree | Sanfoundry
No comments:
Post a Comment