The worst case time to insert a single element in a binary heap with n elements is:

The worst case time to insert a single element in a binary heap with n elements is:

O$(1)$

O$($n$)$

O$($nlogn$)$

O$($logn$)$