Operation Type
Build
Range Query
Point Update
Range Update (Lazy)
Animation Speed
5x
Presets
Stats
Array: 0
Tree Size: 0
Height: 0
Ops: 0
Mode: Sum
Operation Log
Info
Segment Tree is a binary tree for efficient range queries and updates.
Properties:
- Build: O(n) time
- Query: O(log n) per range query
- Update: O(log n) per point update
- Space: O(4n) nodes
Lazy Propagation:
Defers range updates by storing pending values at internal nodes, pushing them down only when needed. Enables O(log n) range updates.
Use Cases:
- Range sum/min/max queries
- Competitive programming
- Interval scheduling
- Database indexing
- Computational geometry
Properties:
- Build: O(n) time
- Query: O(log n) per range query
- Update: O(log n) per point update
- Space: O(4n) nodes
Lazy Propagation:
Defers range updates by storing pending values at internal nodes, pushing them down only when needed. Enables O(log n) range updates.
Use Cases:
- Range sum/min/max queries
- Competitive programming
- Interval scheduling
- Database indexing
- Computational geometry