answersLogoWhite

0

The only drawback I know of is that binary search requires that the list already be sorted. So if you have a really large unsorted list than binary search would not be the best option.

User Avatar

Wiki User

8y ago

What else can I help you with?

Related Questions

What assumption about the list is made when binary search is conducted?

Binary search requires that the list be in search key order.


How can you merge two binary search trees into a single binary search tree?

To merge two binary search trees into a single binary search tree, you can perform an in-order traversal on each tree to extract their elements, combine the elements into a single sorted list, and then construct a new binary search tree from the sorted list. This process ensures that the resulting tree maintains the binary search tree property.


What is the use of binary?

Binary trees are commonly used to implement binary search tree and binary heaps.


A binary search of an orderd set of elements in an array or a sequential search of the elements.Which one is faster?

A binary search is much faster.


What is the binary number for decimal 191?

It is 10111111 in binary. Try a search for '191 to binary'.


Items that are not suitable for a binary search?

The only items suitable for a binary search are those which are in a sorted order.


Does binary tree and binary search tree same?

no they are not same


Are binary search trees always balanced?

No, binary search trees are not always balanced. Balancing a binary search tree involves ensuring that the height difference between the left and right subtrees of each node is at most 1. Unbalanced binary search trees can lead to inefficient search and insertion operations.


How do you print all data in a Binary Search Tree?

By using Depth First Search or Breadth First search Tree traversal algorithm we can print data in Binary search tree.


What is complexity of binary search tree?

The complexity of binary search tree : Search , Insertion and Deletion is O(h) . and the Height can be of O(n) ( if the tree is a skew tree). For Balanced Binary Trees , the Order is O(log n).


What are searching techniques?

1.) serial search 2.) binary search


What is the worst case and best case for interpolation search?

binary search