Teaching Rajasthan Basic Computer Instructor 2021 Mock Test Programming and Data Structure Binary Heap Binary Search Tree
In searching an element in a binary tree, number of comparisons is _________.
1
O(log n-1)
2
O(log n - 2)
3
O(log n)
4
O(n log n)