What are the worst$-$case complexities of insertion and deletion of a key in a binary search tree?

$O(n)$ for both insertion and deletion

O$($logn$)$ for both insertion and deletion

$O(n)$ for deletion, $O(logn)$ for insertion

None of the above