 There are operations such as finding the smallest and largest element that can be done efficiently on a sorted array but not on an unsorted array.A binary search tree is a binary tree data structure that works based on the principle of binary search.The records of the tree are arranged in sorted order, and each record in the tree can be searched using an algorithm similar to binary search, taking on average logarithmic time.