Locating an element in a balanced binary search tree takes $\_\_\_\_$ time.

Group of answer choices

O$($n$)$

O$($log$($n$))$

O$($n$2)$

O$(1)$