Computer scienceAlgorithms and data structuresData structuresGraphsGraph types

Binary search tree

The complexity of basic operations

Report a typo

Choose the correct statement:

Select one option from the list

The run-time of inserting the element is O(log n) at worst

The run-time of the delete operation is O(log n) on average.

The run-time of the search operation is O(n) on average.

If it is possible to find a node in log n comparisons, then at least n comparisons will be needed to delete it.

Create a free account to access the full topic