MCQ IN COMPUTER SCIENCE & ENGINEERING

Detailed explanation-1: -Tree sort is a sorting algorithm that is based on Binary Search Tree data structure. It first creates a binary search tree from the elements of the input list or array and then performs an in-order traversal on the created binary search tree to get the elements in sorted order.

Detailed explanation-2: -Binary search is widely used and one of the fastest search algorithms. It works based on the divide and search principle. The data set must be sorted in increasing or decreasing order before providing it as input to the binary search algorithm.

Detailed explanation-3: -If we know nothing about the distribution of key values, then we have just proved that binary search is the best algorithm available for searching a sorted array.

Detailed explanation-4: -Binary search is faster than linear search except for small arrays. However, the array must be sorted first to be able to apply binary search. There are specialized data structures designed for fast searching, such as hash tables, that can be searched more efficiently than binary search.