Heap Data Structure - GeeksforGeeks

A Heap is a special Tree-based data structure in which the tree is a complete binary tree. Generally, Heaps can be of two types:. Skiptocontent CoursesForWorkingProfessionalsLIVEDSALiveClassesSystemDesignJavaBackendDevelopmentFullStackLIVEExploreMoreSelf-PacedDSA-SelfPacedSDETheoryAllDevelopmentCoursesExploreMoreForStudentsLIVECompetitiveProgrammingGATELiveCourse2023DataScienceExploreMoreSelf-PacedDSA-SelfPacedCIPJAVA/Python/C++ExploreMoreSchoolCoursesSchoolGuidePythonProgrammingLearnToMakeAppsExploremoreAllCoursesTutorialsAlgorithmsAnalysisofAlgorithmsAsymptoticAnalysisWorst,AverageandBestCasesAsymptoticNotationsLittleoandlittleomeganotationsLowerandUpperBoundTheoryAnalysisofLoopsSolvingRecurrencesAmortizedAnalysisWhatdoes'SpaceComplexity'mean?Pseudo-polynomialAlgorithmsPolynomialTimeApproximationSchemeATimeComplexityQuestionSearchingAlgorithmsSortingAlgorithmsGraphAlgorithmsPatternSearchingGeometricAlgorithmsMathematicalBitwiseAlgorithmsRandomizedAlgorithmsGreedyAlgorithmsDynamicProgrammingDivideandConquerBacktrackingBranchandBoundAllAlgorithmsDataStructuresArraysLinkedListStackQueueBinaryTreeBinarySearchTreeHeapHashingGraphAdvancedDataStructureMatrixStringsAllDataStructuresInterviewCornerCompanyPreparationTopTopicsPracticeCompanyQuestionsInterviewExperiencesExperiencedInterviewsInternshipInterviewsCompetititveProgrammingDesignPatternsSystemDesignTutorialMultipleChoiceQuizzesLanguagesCC++JavaPythonC#JavaScriptjQuerySQLPHPScalaPerlGoLanguageHTMLCSSKotlinML&DataScienceMachineLearningDataScienceCSSubjectsMathematicsOperatingSystemDBMSComputerNetworksComputerOrganizationandArchitectureTheoryofComputationCompilerDesignDigitalLogicSoftwareEngineeringGATEGATEComputerScienceNotesLastMinuteNotesGATECSSolvedPapersGATECSOriginalPapersandOfficialKeysGATE2021DatesGATECS2021SyllabusImportantTopicsforGATECSWebTechnologiesHTMLCSSJavaScriptAngularJSReactJSNodeJSBootstrapjQueryPHPSoftwareDesignsSoftwareDesignPatternsSystemDesignTutorialSchoolLearningSchoolProgrammingMathematicsNumberSystemAlgebraTrigonometryStatisticsProbabilityGeometryMensurationCalculusMathsNotes(Class8-12)Class8NotesClass9NotesClass10NotesClass11NotesClass12NotesNCERTSolutionsClass8MathsSolutionClass9MathsSolutionClass10MathsSolutionClass11MathsSolutionClass12MathsSolutionRDSharmaSolutionsClass8MathsSolutionClass9MathsSolutionClass10MathsSolutionClass11MathsSolutionClass12MathsSolutionPhysicsNotes(Class8-11)Class8NotesClass9NotesClass10NotesClass11NotesChemistryNotesClass8NotesClass9NotesClass10NotesCSExams/PSUsISROISROCSOriginalPapersandOfficialKeysISROCSSolvedPapersISROCSSyllabusforScientist/EngineerExamUGCNETUGCNETCSNotesPaperIIUGCNETCSNotesPaperIIIUGCNETCSSolvedPapersStudentCampusAmbassadorProgramSchoolAmbassadorProgramProjectGeekoftheMonthCampusGeekoftheMonthPlacementCourseCompetititveProgrammingTestimonialsStudentChapterGeekontheTopInternshipCareersJobsApplyforJobsPostaJobHirewithUsKnowaboutJobathonJobathonPracticeAllDSAProblemsProblemoftheDayInterviewSeries:WeeklyContestsBi-WizardCoding:SchoolContestsContestsandEventsPracticeSDESheetCuratedDSAListsTop50ArrayProblemsTop50StringProblemsTop50TreeProblemsTop50GraphProblemsTop50DPProblems ComewritearticlesforusandgetfeaturedLearnandcodewiththebestindustryexpertsGetaccesstoad-freecontent,doubtassistanceandmore!ComeandfindyourdreamjobwithusGeeksDigestQuizzesGeeksCampusGblogArticlesIDECampusMantriHomeSavedVideosCoursesGBlogPuzzlesWhat'sNew? ChangeLanguage DataStructuresAlgorithmsInterviewPreparationTopic-wisePracticeC++JavaPythonCompetitiveProgrammingMachineLearningHTMLSDESheetPuzzlesGFGSchoolProjects RelatedArticles ▲TableofContentsDataStructuresIntroductiontoDataStructuresWhatisDataStructure:Types,ClassificationsandApplicationsOverviewofDataStructuresOverviewofDataStructures|Set1(LinearDataStructures)OverviewofDataStructures|Set2(BinaryTree,BST,HeapandHash)OverviewofDataStructures|Set3(Graph,Trie,SegmentTreeandSuffixTree)DifferentTypesofDataStructuresArrayDataStructureStringDataStructureLinkedListDataStructureStackDataStructureQueueDataStructureBinaryTreeDataStructureBinarySearchTreeHeapDataStructureHashingDataStructureGraphDataStructureAndAlgorithmsMatrixDataStructureAdvancedDataStructuresDataStructureAlignment:HowdataisarrangedandaccessedinComputerMemory?WhatShouldILearnFirst:DataStructuresorAlgorithms?HowtoStartLearningDSA?StaticDataStructurevsDynamicDataStructureStaticandDynamicdatastructuresinJavawithExamplesCommonoperationsonvariousDataStructuresReal-timeapplicationofDataStructuresDataStructuresIntroductiontoDataStructuresWhatisDataStructure:Types,ClassificationsandApplicationsOverviewofDataStructuresOverviewofDataStructures|Set1(LinearDataStructures)OverviewofDataStructures|Set2(BinaryTree,BST,HeapandHash)OverviewofDataStructures|Set3(Graph,Trie,SegmentTreeandSuffixTree)DifferentTypesofDataStructuresArrayDataStructureStringDataStructureLinkedListDataStructureStackDataStructureQueueDataStructureBinaryTreeDataStructureBinarySearchTreeHeapDataStructureHashingDataStructureGraphDataStructureAndAlgorithmsMatrixDataStructureAdvancedDataStructuresDataStructureAlignment:HowdataisarrangedandaccessedinComputerMemory?WhatShouldILearnFirst:DataStructuresorAlgorithms?HowtoStartLearningDSA?StaticDataStructurevsDynamicDataStructureStaticandDynamicdatastructuresinJavawithExamplesCommonoperationsonvariousDataStructuresReal-timeapplicationofDataStructuresDataStructureandAlgorithmsCoursePracticeProblemsonHeapRecentarticlesonHeap!AHeapisaspecialTree-baseddatastructureinwhichthetreeisacompletebinarytree.Generally,Heapscanbeoftwotypes:Max-Heap:InaMax-Heapthekeypresentattherootnodemustbegreatestamongthekeyspresentatallofit’schildren.Thesamepropertymustberecursivelytrueforallsub-treesinthatBinaryTree.Min-Heap:InaMin-Heapthekeypresentattherootnodemustbeminimumamongthekeyspresentatallofit’schildren.Thesamepropertymustberecursivelytrueforallsub-treesinthatBinaryTree.PopularArticlesonHeap:BinaryHeapTimeComplexityofbuildingaheapApplicationsofHeapDataStructureBinomialHeapFibonacciHeapLeftistHeapK-aryHeapHeapSortIterativeHeapSortK’thLargestElementinanarrayK’thSmallest/LargestElementinUnsortedArray|Set1Sortanalmostsortedarray/TournamentTree(WinnerTree)andBinaryHeapCheckifagivenBinaryTreeisHeapHowtocheckifagivenarrayrepresentsaBinaryHeap?ConnectnropeswithminimumcostDesignanefficientdatastructureforgivenoperationsMergeksortedarrays|Set1MergeSortTreeforRangeOrderStatisticsSortnumbersstoredondifferentmachinesSmallestDerangementofSequenceLargestDerangementofaSequenceKmaximumsumcombinationsfromtwoarraysMaximumdistinctelementsafterremovingkelementsMaximumdifferencebetweentwosubsetsofmelementsHeightofacompletebinarytree(orHeap)withNnodesHeapSortfordecreasingorderusingminheapPrintallnodeslessthanavaluexinaMinHeap.MedianofStreamofRunningIntegersusingSTLLargesttripletproductinastreamFindknumberswithmostoccurrencesinthegivenarrayConvertBSTtoMinHeapMergetwobinaryMaxHeapsK-thLargestSumContiguousSubarrayMinimumproductofkintegersinanarrayofpositiveIntegersLeafstartingpointinaBinaryHeapdatastructureWhyisBinaryHeapPreferredoverBSTforPriorityQueue?ConvertminHeaptomaxHeapGivenlevelordertraversalofaBinaryTree,checkiftheTreeisaMin-HeapRearrangecharactersinastringsuchthatnotwoadjacentaresameImplementationofBinomialHeapArrayRepresentationOfBinaryHeapSumofallelementsbetweenk1’thandk2’thsmallestelementsMinimumsumoftwonumbersformedfromdigitsofanarrayK’thlargestelementinastreamklargest(orsmallest)elementsinanarray|addedMinHeapmethodMedianinastreamofintegers(runningintegers)Sortanearlysorted(orKsorted)arrayMisc:WhyisBinaryHeapPreferredoverBSTforPriorityQueue?HeapinC++STL|make_heap(),push_heap(),pop_heap(),sort_heap(),is_heap,is_heap_until()HeapinPython(UsingHeapqmodule)WhereisHeapSortusedpractically?Pleasewritecommentsifyoufindanythingincorrect,oryouwanttosharemoreinformationaboutthetopicdiscussedabove.MyPersonalNotes arrow_drop_upSaveWhat'sNewViewDetailsViewDetailsViewDetailsImproveyourCodingSkillswithPracticeTryIt! Weusecookiestoensureyouhavethebestbrowsingexperienceonourwebsite.Byusingoursite,you acknowledgethatyouhavereadandunderstoodour CookiePolicy& PrivacyPolicy GotIt! StartYourCodingJourneyNow!Login Register