When the shape of a BST approaches that of a perfectly balanced binary tree, what is the worst case performance characteristic of searches and insertions? A) O(log n ) B) Oⁿ C) O( n ) D) O(log₂ n )

Question

Quizplus · Accepted Answer

When the shape of a BST approaches that of a perfectly balanced binary tree, the height of the tree is minimized, which leads to a time complexity of O(log n) for both search and insertion operations.

When the Shape of a BST Approaches That of a Perfectly