i am not able to understand the explanation given in the video of how the complexity is O(N).
can you pls help me with it
Time Complexity building a heap(Optimised)
If you perform heapify operation in reverse order, the complexity decreases.
Refer this https://www.geeksforgeeks.org/building-heap-from-array/
Also watch the video once again as the same thing was explained there.
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.