Types of Operations
The operations that the segment tree can perform must be binary and associative. Some of the examples of operations are:
- Finding Range Sum Queries
- Searching index with given prefix sum
- Finding Range Maximum/Minimum
- Counting frequency of Range Maximum/Minimum
- Finding Range GCD/LCM
- Finding Range AND/OR/XOR
- Finding number of zeros in the given range or finding index of Kth zero
Segment Tree
Segment Tree is a versatile data structure used in computer science and data structures that allows efficient querying and updating of intervals or segments of an array. It is particularly useful for problems involving range queries, such as finding the sum, minimum, maximum, or any other operation over a specific range of elements in an array. The tree is built recursively by dividing the array into segments until each segment represents a single element. This structure enables fast query and update operations with a time complexity of O(log n), making it a powerful tool in algorithm design and optimization.
Table of Content
- What is Segment Tree?
- Applications of Segment Tree
- Basics of Segment Tree
- Lazy Propagation
- Range Queries
- Some interesting problem on Segment Tree