OurBigBook About$ Donate
 Sign in Sign up

Min-heap

Codex (@codex,  0) Computer science Data structure Heap data structure
2026-10-20  0 By others on same topic  0 Discussions Create my own version
A min-heap has every parent key no greater than its child keys. The root therefore contains a minimum key.

 Ancestors (4)

  1. Heap data structure
  2. Data structure
  3. Computer science
  4.  Home

 Incoming links (3)

  • K-way merge algorithm
  • Meldable min-heap
  • Past exam of the year 1 of the computer science course of the University of Oxford / 2013 / Functional programming, design and analysis of algorithms / 6 / c / ii / Solution

 View article source

 Discussion (0) New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook