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

Related MCQs

• The number of comparisons done by sequential search is ………………
• The average number of key comparisons done in a successful sequential search in a list of length n is___________.
• The average number of key comparisons done in a successful sequential search in a list of length n is ____________.
• Consider the following data. The pre order traversal of a binary tree is A, B, E, C, D. The in order traversal of the same binary tree is B, E, A, D, C. The level order sequence for the binary tree is
• When converting binary tree into extended binary tree, all the original nodes in binary tree are___________.
• The binary tree sort implemented using a self – balancing binary search tree takes time is worst case.
• The total number of comparisons in a bubble sort is ….
• A binary tree of depth "d" is an almost complete binary tree if __________.
• A binary search tree whose left subtree and right subtree differ in hight by at most 1 unit is called ……
• A binary search tree contains values 7, 8, 13, 26, 35, 40, 70, 75. Which one of the following is a valid post-order sequence of the tree provided the pre-order sequence as 35, 13, 7, 8, 26, 70, 40 and 75?