Tutorialspoint.dev

Introduction To

Heap Data Structure

Heap is a specialized tree-based data structure which is essentially an almost complete tree that satisfies the heap property. In a max heap, for any given node C, if P is a parent node of C, then the key (the value) of P is greater than or equal to the key of C. In a min heap, the key of P is less than or equal to the key of C. The node at the "top" of the heap (with no parents) is called the root node.

Heaps are usually implemented in an array (fixed size or dynamic array), and do not require pointers between elements. After an element is inserted into or deleted from a heap, the heap property may be violated and the heap must be balanced by internal operations.

 

Course Structure

Popular Articles on Heap

Subscribe to Our Newsletter