1.

What is the time taken for a range query for a perfectly balanced tree?

A. O(N)
B. O(log N)
C. O(√N+M)
D. O(√N)
Answer» D. O(√N)


Discussion

No Comment Found