Data Structures (BCA) 3rd Sem Previous Year Solved Question Paper 2022

Practice Mode:
20.

Calculate the complexity of Binary Search tree.

Explanation

The time complexity of a binary search algorithm is O(log n), where 'n' is the number of elements in the sorted array. This is because binary search repeatedly divides the search space in half, resulting in a logarithmic time complexity.

<< Previous Question
Next Question >>