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: Option C
This Question Belongs to Data Structure >> Trees In Data Structures
Related Questions on Trees in Data Structures
A. Inorder
B. Preorder
C. Postorder
D. Level-order
Join The Discussion