Segment Tree

Category: Advanced

Difficulty: advanced

Description: Range query data structure

Time Complexity: O(log n)

Space Complexity: O(n)

Related LeetCode Problems

• 307. Range Sum Query - Mutable (Medium)
• 308. Range Sum Query 2D - Mutable (Hard)
• 215. Kth Largest Element in an Array (Medium)
• 699. Falling Squares (Hard)
• 327. Count of Range Sum (Hard)
• 1582. Special Positions in a Binary Matrix (Medium)
• 315. Count of Smaller Numbers After Self (Hard)
• 2202. Max Sum of Rectangle No Larger Than K (related range queries) (Hard)