Vidyalelo
Data Structure · Q142

Trees in Data Structures

Programming · Data Structure · question 142

Q142

What is the worst case of finding the nearest neighbour?

A.
O(N)
Answer
B.
O(N log N)
C.
O( log N)
D.
O(N3)

Answer: Option A

Solution

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