Creating a Heap is inserting all the elements of a given array into an existing heap assuming the first element of the given array as the initial heap, where as Heapify is simply creating a CBT ( complete binary tree) with all the elements of the given array and then converting that CBT into a heap, by moving up from the last non-leaf node up to the root.
I am also active at:
Subscribe to:
Post Comments (Atom)
Sacred Thought
5 May 2024 Hari Om Verse 50-51, chapter two: In this chapter two Shree krishna explains a simple way of living. Free from desires and void ...
-
Acronym Full Form AJAX Asynchronous JavaScript and XML API Application Programming Interface APK Android Application Package ASP Activ...
-
#include<stdio.h> int main() { int M,N,q; scanf("%i %i",&M, &N); if((M%N)!=0) {printf("0&quo...
-
Define a Python function ascending(l) that returns True if each element in its input list is at least as big as the one before it. Here...
No comments:
Post a Comment