Time complexity of inserting n elements in heap

#1

i think it should be O(nlogn)
but ans is O(n) can you exolain how it works in O(n)

#2

hello @Nishant_08
pls refer this for mathematical proof ->
heap

#3

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.