Title | Heap |
Level | Under Graduate |
Course: | Data Structures |
Summary: | A heap is a specialized tree-based data structure that satisfies the heap property: if B is a child node of A, then key(A) ≥ key(B). |
Keywords | Heap |
Language: | English |
| |
| |
 |  |
|
|
|
| |
Other Details | |
Last modified on: | 2011-12-15 17:19:36.573199 |
| |
 |
|
|
Credits | |
IDD writer: | Phani Swathi Chitta |
Mentor: | Prof. Sachin Patkar |
Developer: | Sachin Patil |
| |
| |
 |
 |
|
 |
|
|
|
|
|
|
|
|
|