Question

Binary search tree definition and operations in data structure

Answer 1

In binary search, the array is repeatedly divided into halves and the search is undertaken in one half which is likely to contain the item searched for. The searched item will be equal to or less than or greater than the middle most element of the array or its half, and so on.

The binary search technique is much faster than linear search, as half of the array is eliminated after every round of the search.

Hope helpful...

Thanku..