Question $9(1$ point$)$

This is a multi$-$select question. Learners earn full points only when all correct answers are selected and all incorrect answers are left blank. Learners cannot earn partial points.

Which operations in a Random BST can be expected to have $\backslash ($ O$(\backslash$log n$)\backslash )$ time complexity?

Choose all that apply.

A single rotation

Finding the minimum data item

In$-$Order Traversal

Finding the third$-$largest data item.

Insertion$/$Deletion

Search