In a balanced Binary Search Tree, the time complexity of the search, insert, and delete operations are:

Select one:

$O(logn)$ for search and $O(n)$ for insert and delete

$O(n)$ for all three operations

$O(logn)$ for all three operations

$O(logn)$ for search and insert and $O(n)$ for delete

cross out

cross out

cross out

cross out