What is the time complexity of searching for an element in a balanced binary search tree $($BST$)?$

A$.$ O$($log n$)$

B$.$ O$($n$)$

C$.$ O$($n$^2)$

D$.$ O$(1)$