In general, the binary search method needs no more than ……………. comparisons.

Related Questions

• The number of comparisons done by sequential search is ………………
• The total number of comparisons in a bubble sort is ….
• A binary search tree whose left subtree and right subtree differ in hight by at most 1 unit is called ……
• Consider the following statements:i. First-in-first out types of computations are efficiently supported by STACKS. ii. Implementing LISTS on linked lists is more efficient than implementing LISTS on an array for almost all the basic LIST operations. iii. Implementing QUEUES on a circular array is more efficient than implementing QUEUES on a linear array with two indices. iv. Last-in-first-out type of computations are efficiently supported by QUEUES.Which of the following is correct?
• Which data structure is used in breadth first search of a graph to hold nodes?
• In ……………, search start at the beginning of the list and check every element in the list.
• The property of binary tree is
• To perform level-order traversal on a binary tree, which of the following data structure will be required?
• A binary tree in which all its levels except the last, have maximum numbers of nodes, and all the nodes in the last level have only one child it will be its left child. Name the tree.
• Which of following data structure is more appropriate for implementing quick sort iteratively?