

MCQOPTIONS
Saved Bookmarks
1. |
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» D. O( log 2n). | |