faqts : Computers : Basics

+ Search
Add Entry AlertManage Folder Edit Entry Add page to http://del.icio.us/
Did You Find This Entry Useful?

2 of 3 people (67%) answered Yes
Recently 2 of 3 people (67%) answered Yes


whta is heap in datastructure

Aug 22nd, 2008 11:11
vijay y, AJAY TIWARI, http://www.hit.ac.il/staff/yuliak/Algorithm/Heaps.pdf

A Heap data structure is a binary tree with the following properties:
1. It is a complete binary tree; that is, each level of the tree is 
completely filled, except possibly the bottom level. At this level, it 
is filled from left to right.
2. It satisfies the heap-order property: The data item stored in each 
node is greater than or equal to the data items stored in its children.
An example of heap data structure is given below:
    / \
   8   4
  / \   \  
 6   2   3