Given a binary search tree with n nodes and height h$,$ what is the maximum number of comparisons that each operation requires for the method insert?

Group of answer choices

O$($h$)$

O$(1)$

O$($log h$)$

O$($n $+$ h$)$