In this lecture i discussed
0:00 Maintaining the heap property
0:54 MAX-HEAPIFY procedure
1:56 Example: The action of MAX-HEAPIFY(A,2), where A.heap-size=10
5:07 Running Time of MAX-HEAPIFY procedure
5:47 Exercises :illustrate the operation of MAX-HEAPIFY(A,3) on the array A= {27, 17, 3, 16, 13, 10, 1, 5, 7, 12, 4, 8, 9, 0}.
----------------------------------------------------
Subscribe my channel for more updates / monalisacs
----------------------------------------------------------
Join Telegram GATE CSE study group: https://t.me/MonalisaCSE
----------------------------------------------------------------
Algorithm Lectures : • Algorithm Lectures for GATE CSE by Monalis...
Algorithm GATE PYQ: • Algorithm GATE CS & DA PYQ(2010-2025) solv...
----------------------------------------------------------------
Compiler Design Lectures : • Ch 1.1:Language Processing System |CD Lect...
Compiler Design PYQ : • Ch 1.1:Language Processing System |CD Lect...
----------------------------------------------------------------------
Theory Of Computation Lectures • Video
TOC GATE PYQ: • GATE CS 2010,Q39:Let L={w ∈ (0 + 1)* | w h...
-------------------------------------------------------------------
Data Structure Lecture: • Data Structure Syllabus for GATE
Data Structure PYQ: • Data Structure Syllabus for GATE
-----------------------------------------------------------------------
#Heap#GATE_CSE#Transform-and-Conquer#MAX-HEAPIFY