A technique for direct search is _______________.

Related MCQs

• A binary search tree whose left subtree and right subtree differ in hight by at most 1 unit is called ……
• Which data structure is used in breadth first search of a graph to hold nodes?
• The number of comparisons done by sequential search is ………………
• In ……………, search start at the beginning of the list and check every element in the list.
• In general, the binary search method needs no more than ……………. comparisons.
• 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?
• In a binary search tree, which of the following traversals would print the numbers in the ascending order?
• Which of the following is false about a binary search tree?
• What is the speciality about the inorder traversal of a binary search tree?
• What are the worst case and average case complexities of a binary search tree?