Vidyalelo
Data Structure · Q115

Trees in Data Structures

Programming · Data Structure · question 115

Q115

How many prime concepts are available in nearest neighbour search in a kd tree?

A.
1
B.
2
C.
3
Answer
D.
4

Answer: Option C

Solution

Answer: Option C
No explanation is given for this question Let's Discuss on Board