Saved Bookmarks
| 1. |
What Is A Heap In Data Structure? |
|
Answer» HEAP is a special balanced BINARY tree DATA structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key VALUE less than its CHILDS and a max-heap parent node has value greater than its childs. Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs. |
|