Which is true about binary search trees?
A) they cannot support logarithmic insertions
B) they can support logarithmic searches
C) they don't work well for sorted collections
D) each node in the right subtree of a given node is less than that node

Question

Quizplus · Accepted Answer

Binary search trees are specifically designed for efficient searching. They support logarithmic searches because each node in the left subtree of a given node is less than that node, and each node in the right subtree of a given node is greater than or equal to that node. This allows for efficient searching by halving the search space at each step. However, insertions may not always be logarithmic as the tree can become unbalanced with certain insertion orders.

Which Is True About Binary Search Trees