Instantiating heaps
Since heaps are a form of tree data structure, it is unsurprising that we will not find a native concrete implementation in the languages we are discussing. However, the heap data structure is actually quite simple to implement. Therefore, we are going to build our own heap structure, specifically a min heap.
Get Everyday Data Structures now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
