https://github.com/harshit7962/heap_for_beginners
https://github.com/harshit7962/heap_for_beginners
Last synced: about 2 months ago
JSON representation
- Host: GitHub
- URL: https://github.com/harshit7962/heap_for_beginners
- Owner: harshit7962
- Created: 2022-06-14T11:31:04.000Z (almost 3 years ago)
- Default Branch: main
- Last Pushed: 2022-06-15T12:00:48.000Z (almost 3 years ago)
- Last Synced: 2025-02-09T04:36:02.394Z (3 months ago)
- Language: C++
- Size: 16.6 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# Heap For Beginners
A heap is a special tree based data structure. More precisely, heap is a complete binary tree.
There are two types of heap:
1) **Min-Heap:** The key present at the root node must be the minimum among the keys present int all of its children.
2) **Max-Heap:** The key present at the root node must be the maximum among the keys present in all of its children.
A heap is basically an array, which is cache friendly and gives us hierarchy of tree...
The index of various elements in a heap is defined by its parent...
* The index of left child of a parent is : 2 * i + 1 (i is the index of parent)
* The index of right child of a parent is: 2 * i + 2 (i is the index of parent)
* The index of parent of a node is: floor of i-1/2 (i is the index of child)
### A heap can be represented in C++ as:
```cpp
struct Heap {
int *arr;
int cap;
int size;
Heap(int c) {
cap = c;
arr = new int[cap];
size = 1;
}
int left(int i) {
if(size<=(2*i+1)) return -1;
return 2*i+1;
}
int right(int i) {
if(size<=(2*i+2)) return -1;
return 2*i+2;
}
int parent(int i) {
if(i==0) return -1;
return (i-1)/2;
}
};
```