A(n) _____________ BST is a BST in which insertions, retrievals, and removals are all done in O( lg n ) time, using the best possible time complexity that applies.

A. fast
B. logarithmic
C. balanced
D. unbalanced

C

Computer Science & Information Technology

You might also like to view...

In the accompanying figure, the ____ areas are represented by white.

A. colored B. selected C. unselected D. lost

Computer Science & Information Technology

The item in the right pane of the accompanying figure is a ____.

A. Wizard B. bar chart C. analysis tool D. report

Computer Science & Information Technology