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

Options
- O(n)
- O(1)
- O(2n)
- O(log 2n)

CORRECT ANSWER : O(1)

Discussion Board
problem in the answer

Best case for any search algorithm is any day O(1) which is not in the option because you will always have a probability of getting data at the place from where you started searching

Ichchhit Baranwal 03-20-2015 12:42 PM

Write your comments


Enter the code shown above:

(Note: If you cannot read the numbers in the above image, reload the page to generate a new one.)


Related Content

Advertisement
 
▲