+1 vote
in Data Structures & Algorithms I by (110k points)
Bin is an example of a range query data structure.

(a) true

(b) false

Query is from Trees in division Trees of Data Structures & Algorithms I

The question was asked during an internship interview.

1 Answer

+1 vote
by (672k points)
selected by
 
Best answer
The correct option is (a) true

For explanation: Bin is an example of a range query data structure. It is because it efficiently answers any number of queries on any subset of the input.

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.

Categories

...