Several kinds of queries are possible on a k-d called as?
(a) partial queries
(b) range queries
(c) neighbour queries
(d) search queries
This interesting question is from Trees topic in chapter Trees of Data Structures & Algorithms I
I had been asked this question in homework.