📚 dsaflash.cards
Problems
Log in
Sign up
Home
/
Advanced Data Structures
/
Segment Trees and Fenwick Trees
Segment Trees and Fenwick Trees
Question 1 of 6
What does each node in a segment tree represent?
A
A comparison result between two adjacent elements
B
A pointer to the next level of the binary tree
C
A single element of the original array
D
An interval (subarray) of the original array, storing the aggregated value for that interval
← Back to categories