In this tutorial we will see all the functionalities of heaps implemented through java language. package com . problems . heap ; public class HeapFunctions { //Function to generate maxheapify where root is max than childs public void maxHeapify ( int Arr [], int i , int N ) { int largest ; int left = 2 * i + 1 ; //left child int right = 2 * i + 2 ; //right child System . out . println ( "left" + " " + left ); System . out . println ( "right" + " " + right ); System . out . println ( "Max size" + " " + N ); if ( left < N && Arr [ left ] > Arr [ i ] ) { largest = left ; System . out . println ( "largest left" + largest ); } else { largest = i ; System . out . println ( "largest i" + largest ); } if ( rig...
Data structures, Algorithms and system designs