Segment trees for range queries in Data Structures Theory - Cheat Sheet & Quick Revision

Recall & Review

beginner

What is a segment tree?

A segment tree is a tree data structure used to store information about intervals or segments. It allows efficient querying and updating of ranges in an array.

beginner

How does a segment tree help with range queries?

A segment tree breaks the array into segments and stores information about each segment. This lets you quickly find answers for any range query by combining results from relevant segments.

intermediate

What is the time complexity for building a segment tree for an array of size n?

Building a segment tree takes O(n) time because it processes each element and builds nodes for segments in a bottom-up manner.

intermediate

What is the time complexity for querying a range in a segment tree?

Querying a range in a segment tree takes O(log n) time because it visits only a few nodes that cover the query range.

intermediate

How does updating a value in the array affect the segment tree?

When a value in the array changes, the segment tree updates the nodes that cover that position. This update also takes O(log n) time.

What does a segment tree store at each node?

A Information about a segment or range of the array

B Only a single element value

C The entire array

D Random values

Each node in a segment tree stores information about a specific segment or range of the array.

What is the main advantage of using a segment tree for range queries?

A Faster queries and updates compared to scanning the array

B Uses less memory than arrays

C Simpler to implement than arrays

D Works only for sorted arrays

Segment trees allow fast range queries and updates, much faster than scanning the array each time.

What is the worst-case time complexity to update a single element in a segment tree?

A O(n log n)

B O(n)

C O(1)

D O(log n)

Updating a single element requires updating nodes along the path, which takes O(log n) time.

Which of these operations can segment trees NOT efficiently perform?

A Range sum queries

B Sorting the array

C Range maximum queries

D Range minimum queries

Segment trees are for range queries and updates, not for sorting the array.

How much memory does a segment tree typically require for an array of size n?

A O(n)

B O(n log n)

C O(4n)

D O(2n)

A segment tree usually requires about 4 times the size of the array to store all nodes.

Explain how a segment tree is built and how it helps answer range queries efficiently.

Think about breaking the array into parts and storing info for each.

Describe the process and time complexity of updating a value in a segment tree.

Consider how changes propagate up the tree.

Practice

1. What is the main purpose of a segment tree in data structures?

easy

A. To quickly answer queries about a range of elements in an array

B. To sort elements in ascending order

C. To store elements in a linked list format

D. To perform binary search on a sorted array

Solution

1. Step 1: Understand the role of segment trees

   Segment trees are designed to efficiently answer queries about ranges, such as sums or minimums, in an array.

2. Step 2: Compare with other data structures

   Unlike sorting or binary search, segment trees focus on range queries and updates, not ordering or searching single elements.

3. Final Answer:

   To quickly answer queries about a range of elements in an array -> Option A

4. Quick Check:

   Segment tree = fast range queries [OK]

Hint: Segment trees speed up range queries, not sorting or searching [OK]

Common Mistakes:

• Confusing segment trees with sorting algorithms
• Thinking segment trees are for searching single elements
• Assuming segment trees store data like linked lists

2. Which of the following is the correct way to represent a segment tree for an array of size n?

easy

A. Using an array of size 2*n - 1

B. Using a linked list of size n

C. Using an array of size n

D. Using a binary search tree with n nodes

Solution

1. Step 1: Recall segment tree size formula

   A segment tree for an array of size n is usually stored in an array of size about 2*n - 1 to hold all nodes including internal and leaf nodes.

2. Step 2: Eliminate incorrect options

   Linked lists and binary search trees do not represent segment trees efficiently. An array of size n is too small to hold all nodes.

3. Final Answer:

   Using an array of size 2*n - 1 -> Option A

4. Quick Check:

   Segment tree size ≈ 2*n - 1 [OK]

Hint: Segment tree array size is about twice the input size minus one [OK]

Common Mistakes:

• Using linked lists instead of arrays
• Assuming segment tree size equals input size
• Confusing segment trees with binary search trees

3. Given the array [2, 5, 1, 4], what is the result of a range sum query from index 1 to 3 (0-based) using a segment tree?

medium

A. 6

B. 9

C. 10

D. 7

Solution

1. Step 1: Identify the elements in the range

   Indices 1 to 3 correspond to elements 5, 1, and 4.

2. Step 2: Calculate the sum of these elements

   Sum = 5 + 1 + 4 = 10.

3. Step 3: Verify the options

   10 is 10, but the question asks for the sum from index 1 to 3 inclusive, which is 5 + 1 + 4 = 10.

4. Final Answer:

   10 -> Option C

5. Quick Check:

   Sum(5,1,4) = 10 [OK]

Hint: Add elements in the given index range carefully [OK]

Common Mistakes:

• Off-by-one errors in index range
• Adding wrong elements outside the range
• Confusing 0-based and 1-based indexing

4. Consider a segment tree built for minimum queries on the array [3, 8, 7, 6, 2]. If the update operation changes the element at index 2 to 1, what is the new minimum value in the range 1 to 4?

medium

A. 2

B. 6

C. 3

D. 1

Solution

1. Step 1: Understand the update effect

   Original array: [3, 8, 7, 6, 2]. After update at index 2: [3, 8, 1, 6, 2].

2. Step 2: Find minimum in range 1 to 4

   Elements in range: 8, 1, 6, 2. Minimum is 1.

3. Final Answer:

   1 -> Option D

4. Quick Check:

   Updated min in range = 1 [OK]

Hint: Update changes minimum; re-check range after update [OK]

Common Mistakes:

• Forgetting to update the segment tree after change
• Using old values for minimum query
• Misidentifying the range boundaries

5. You have a large array and need to perform many range sum queries and point updates efficiently. Which of the following best explains why a segment tree is preferred over a simple prefix sum array?

hard

A. Segment trees use less memory than prefix sums

B. Segment trees allow both updates and queries in logarithmic time, prefix sums require linear time for updates

C. Prefix sums allow faster updates than segment trees

D. Prefix sums can handle range minimum queries better than segment trees

Solution

1. Step 1: Compare update and query times

   Prefix sums allow fast range sum queries but updating an element requires recalculating many prefix sums, which is linear time.

2. Step 2: Understand segment tree advantages

   Segment trees support both point updates and range queries in O(log n) time, making them efficient for many operations.

3. Final Answer:

   Segment trees allow both updates and queries in logarithmic time, prefix sums require linear time for updates -> Option B

4. Quick Check:

   Segment tree = fast updates + queries [OK]

Hint: Segment trees handle updates and queries fast; prefix sums don't [OK]

Common Mistakes:

• Assuming prefix sums update quickly
• Thinking segment trees use less memory
• Confusing range sum with range minimum queries