In the worst case scenario, a search against an unbalanced binary search has a performance cost of O(__________).
A) 1
B) log n
C) n
D) n log n

Question

Quizplus · Accepted Answer

In the worst case scenario, an unbalanced binary search tree can degenerate into a structure similar to a linked list, especially if elements are inserted in a sorted order. This means that for every search operation, you might need to traverse through all the elements, leading to a time complexity of O(n).

In the Worst Case Scenario, a Search Against an Unbalanced