Multiple Choice
Locating a particular item in a binary search tree of n nodes requires at most ______ comparisons.
A) n
B) n * 3
C) n / 2
D) n - (n / 2)
Correct Answer:
Verified
Correct Answer:
Verified
Related Questions
Q24: What is a bucket?
Q25: What is a disadvantage of a 2-3-4
Q26: Suppose we wanted to use a hash
Q27: _ is a collision-resolution scheme that searches
Q28: The maximum height of a binary search
Q30: What is meant by clustering? How does
Q31: A 4-node is found in a(n)_.<br>A)AVL tree<br>B)2-3
Q32: A 2-3 tree of height h always
Q33: Searching a 2-3 tree is _.<br>A)O(n)<br>B)O(log2ⁿ)<br>C)O(log2ⁿ *
Q34: Which of the following is NOT true