0
Still curious? Ask our experts.
Chat with our AI personalities
Ross
Jordan
Judy
Add your answer:
Earn +20 pts
What assumption about the list is made when binary search is conducted?
Binary search requires that the list be in search key order.
Is sorting a binary search tree simple?
A binary search tree is already ordered. An in order traversal will give you a sorted list of nodes.
Which of the following traversal is used for printing the keys of binary search tree in ascending order?
In order traversal is used.
How do you do binary search in file?
A binary search on a random-access file is performed much in the same way as a binary search in memory is performed, with the exception that instead of pointers to items in memory file seek operations are used to locate individual items within the file, then load into memory for further examination. The key aspects of the binary search algorithm do not depend on the specifics of the set of searchable items: the set is expected to be sorted, and it must be possible to determine an order between any two items A and B. Finally, the binary search algorithm requires that the set of searchable items is finite in size, and of a known size.
What are the advantages and disadvantages of binary search algorithms?
the major limitation of binary search is that there is a need of sorted array to perform binary search operation. if array is not sorted the output is either not correct or may be after a long number of steps and according to data structure the output should come in minimum number of steps.
