This week's giveaway is in the Spring forum. We're giving away four copies of REST with Spring (video course) and have Eugen Paraschiv on-line! See this thread for details.

hey, can someone tell what a binary heap is? I've surched through a bunch of textbooks without finding a clear answer. [ May 31, 2005: Message edited by: Frederik Vig ]

- It's a heap, so every node n (other than the root), is greater than it's parent. - It's a complete binary tree, that is it's a tree T, where all the levels in the tree have the maximum number of nodes possible.

Example:

Feel free to reply back, if you need further explaination.

Another way of talking about a binary heap is as a binary tree which has the property of being heap-ordered and left-to-right filled. A tree is heap-ordered if, given an ordering operator, the parent node is no later in the ordering than its children. Being left-to-right filled means that if there is a space available on a level, nodes are added left-to-right.

The space property of binary heaps makes them complete binary trees, except possibly for the lowest level. It is the heap property that makes them heaps.

Any decent data structures text should have basic information on binary heaps. They're usually just called heaps in your more basic texts, and are often discussed in the context of sorting, because binary heaps provide an efficient means for sorting items. A very good and comprehensive discussion is in the chapter on Heapsort in the big Intro to Algorithms book by Cormen et al. [ May 31, 2005: Message edited by: Adam Vinueza ]