Time Complexity of Searching a Binary Search Tree

What is the average time complexity of finding an element in a binary search tree with $n$ elements?

Pick ONE option

$0(lo{g}_{2}n)$

$0(1)$

$0($n$)$

$0($n log$2$ n$)$