Q.

The time required in best case for search operation in binary tree is ____________.

A. O(n).
B. O(2n).
C. O(log n).
D. O( log 2n).
Answer» C. O(log n).
3.4k
0
Do you find this helpful?
34

View all MCQs in

Data Structures (DS)

Discussion

No comments yet