Question

Explain the concept of binary search with example.

Answer 1

A binary search tree is a binary tree data structure that works based on the principle of b8nary search. The recirds of the tree are arranged in sorted order, and each record inthe tree can be searched using 8n algorithm similar to binary search, taking on average logarithmic time.