The time complexity for deleting an element into a binary search tree is $\_\_\_\_\_\_\_.$

Group of answer choices

O$($n log n$)$

O$($n$^2)$

O$($n$)$

O$(1)$

O$($log n$)$