Data Structures and Algorithms in Python/

...

/

Quiz

Quiz

It's quiz time! Test yourself by solving these questions about binary search trees.

We'll cover the following...
Technical Quiz
1.

The worst-case time complexity of insert, search and delete operations in a binary search tree is as follows:

A.

O(1)O(1)

B.

O(logn)O(log n)

C.

O(n)O(n)

D.

O(nlogn)O(n log n)

1 / 5