A binary search tree T contains n distinct elements. What is the time complexity of picking an element in T that is smaller than the maximum element in T$?$

Select one:

a$.\backslash$Theta $($nlogn$)$

b$.\backslash$Theta $($logn$)$

c$.\backslash$Theta $($n$)$

d$.\backslash$Theta $(1)$