In this video bhaiya said GET time complexity is just access of top element so O(1)
But, while comparison he said all heap operations get, pop,push are of O(log n)
Heap property doubt
yes it is correct
that get() has time complexity O(1)
and push(), pop() has time complexity O(logn)
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.