What is the worst case time complexity to search for an element in a binary search tree $($BST$)$ with

nodes?

Question $3$ options:

O$($n$)$

O$($logn$)$

O$(1)$

O$($nlogn$)$