Heap data structure

Posted by turmoil on Stack Overflow See other posts from Stack Overflow or by turmoil
Published on 2010-03-22T14:19:04Z Indexed on 2010/03/22 14:21 UTC
Read the original article Hit count: 448

Filed under:

binary-heap

Trying to think of a lower bound to the position of say, the nth largest key in a max-heap. Assuming the heap's laid out in array. The upper bound's min(2^n-2, array size -1) i think, but is it always lower bounded by 0?

Related posts about binary-heap

Binary Heap Traversal Proof by Induction

as seen on Stack Overflow - Search for 'Stack Overflow'
How to prove that: Let's say we have two binary heap trees H1 and H2 with size N. If their inorder traversals are the same, prove that H1=H2 by induction on N. >>> More
Re-adjusting a binary heap after removing the minimum element

as seen on Stack Overflow - Search for 'Stack Overflow'
After removing the minimum element in a binary heap, i.e. after removing the root, why is the last leaf then assigned to the root and sifted down? Why not take the lesser child of what used to be the root and just keep sifting up all the children? Isn't this the same amount of operations, so why… >>> More
Pointer-based binary heap implementation

as seen on Stack Overflow - Search for 'Stack Overflow'
Is it even possible to implement a binary heap using pointers rather than an array? I have searched around the internet (including SO) and no answer can be found. The main problem here is that, how do you keep track of the last pointer? When you insert X into the heap, you place X at the last pointer… >>> More
Heap data structure

as seen on Stack Overflow - Search for 'Stack Overflow'
Trying to think of a lower bound to the position of say, the nth largest key in a max-heap. Assuming the heap's laid out in array. The upper bound's min(2^n-2, array size -1) i think, but is it always lower bounded by 0? >>> More
Efficient heaps in purely functional languages

as seen on Stack Overflow - Search for 'Stack Overflow'
As an exercise in Haskell, I'm trying to implement heapsort. The heap is usually implemented as an array in imperative languages, but this would be hugely inefficient in purely functional languages. So I've looked at binary heaps, but everything I found so far describes them from an imperative viewpoint… >>> More

Developer IT

Heap data structure - Developer IT

Heap data structure

binary-heap

Related posts about binary-heap

Binary Heap Traversal Proof by Induction

Re-adjusting a binary heap after removing the minimum element

Pointer-based binary heap implementation

Heap data structure

Efficient heaps in purely functional languages

Categories cloud