Multiple Choice
In the worst case, a general binary search tree could require __________________ comparisons to find an element.
A) O(1)
B) O(n)
C) O(2n)
D) O(log2 n)
E) none of the above
Correct Answer:
Verified
Correct Answer:
Verified
Related Questions
Q6: In a maxheap, the largest element is
Q7: A _ is a complete binary tree
Q8: A binary search tree is always a
Q9: Describe how to find an element in
Q10: Explain how heap sort works.
Q12: When removing an element from a binary
Q13: A _ is a tree whose elements
Q14: When adding a new element to a
Q15: When removing an element from a binary
Q16: Does the find and add operations on