Q132
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)
AnswerD.
O(√N)
Answer: Option C
Solution
Answer: Option C
No explanation is given for this question Let's Discuss on Board