Time Complexity of BST for all key operations is:

$O(n)$

$O(logn)$

$O(n^2)$

$O(nlogn)$