Heap Data Structure #2: Max Heapify Function, Building Max-heap from an Array

Published: 04 March 2023
on channel: KnowledgeCorridor

178

Strength of heap data structure is owing to Max-Heapify function. This function converts a heap into max-heap. If the sub-heaps of a node are already max-heap but the node itself violates max-heap property then we pass the index of that node to max-heapify function and it guarantees the entire tree rooted at the node to be max heap.
The time complexity of max heap is order of lgn (log base 2 of n). It recursively adjust the node, its left and right children and goes down the leaves.
The build max-heap function takes an array and converts it to max heap. It goes from n/2 to 1 and every time runs the max heap function in bottom-up fashion. Every time it renders the sub-tree rooted at the corresponding index a max heap. Finally it takes the root and converts it into max heap.
Thus build-max function is called n/2 times, where every time it runs max-heapify which has complexity of lg n, so the time complexity of build max is O(n/2. lgn) = O(nlgn)

On this page of the site you can watch the video online Heap Data Structure #2: Max Heapify Function, Building Max-heap from an Array with a duration of hours minute second in good quality, which was uploaded by the user KnowledgeCorridor 04 March 2023, share the link with friends and acquaintances, this video has already been watched 178 times on youtube and it was liked by 7 viewers. Enjoy your viewing!

20,407

682