gaspersic/freeCodeCamp
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

fix max heap insert function (#43285)

Browse Source
This commit is contained in:
Anshul Singh
2021-08-27 20:40:29 +05:30
committed by GitHub
parent e67870f243
commit f834d648e8
2 changed files with 40 additions and 24 deletions
Download Patch File Download Diff File Expand all files Collapse all files

32
curriculum/challenges/english/10-coding-interview-prep/data-structures/insert-an-element-into-a-max-heap.md
View File

@@ -133,20 +133,28 @@ var MaxHeap = function() {
```js ```js
var MaxHeap = function() { var MaxHeap = function() {
// Only change code below this line // Only change code below this line
this.heap = [null]; this.heap = [];
this.insert = (ele) => { this.parent = index => {
var index = this.heap.length; return Math.floor((index - 1) / 2);
var arr = [...this.heap]; }
arr.push(ele); this.insert = element => {
while (ele > arr[Math.floor(index / 2)] && index > 1) { this.heap.push(element);
arr[index] = arr[Math.floor(index / 2)]; this.heapifyUp(this.heap.length - 1);
arr[Math.floor(index / 2)] = ele; }
index = arr[Math.floor(index / 2)]; this.heapifyUp = index => {
} let currentIndex = index,
this.heap = arr; parentIndex = this.parent(currentIndex);
while (currentIndex > 0 && this.heap[currentIndex] > this.heap[parentIndex]) {
this.swap(currentIndex, parentIndex);
currentIndex = parentIndex;
parentIndex = this.parent(parentIndex);
}
}
this.swap = (index1, index2) => {
[this.heap[index1], this.heap[index2]] = [this.heap[index2], this.heap[index1]];
} }
this.print = () => { this.print = () => {
return this.heap.slice(1); return this.heap;
} }
// Only change code above this line // Only change code above this line
}; };

32
curriculum/challenges/english/10-coding-interview-prep/data-structures/remove-an-element-from-a-max-heap.md
View File

@@ -114,21 +114,29 @@ assert(
## --seed-contents-- ## --seed-contents--
```js ```js
var MaxHeap = function() { var MaxHeap = function () {
this.heap = [null]; this.heap = [];
this.insert = (ele) => { this.parent = index => {
var index = this.heap.length; return Math.floor((index - 1) / 2);
var arr = [...this.heap]; }
arr.push(ele); this.insert = element => {
while (ele > arr[Math.floor(index / 2)] && index > 1) { this.heap.push(element);
arr[index] = arr[Math.floor(index / 2)]; this.heapifyUp(this.heap.length - 1);
arr[Math.floor(index / 2)] = ele; }
index = arr[Math.floor(index / 2)]; this.heapifyUp = index => {
let currentIndex = index,
parentIndex = this.parent(currentIndex);
while (currentIndex > 0 && this.heap[currentIndex] > this.heap[parentIndex]) {
this.swap(currentIndex, parentIndex);
currentIndex = parentIndex;
parentIndex = this.parent(parentIndex);
} }
this.heap = arr; }
this.swap = (index1, index2) => {
[this.heap[index1], this.heap[index2]] = [this.heap[index2], this.heap[index1]];
} }
this.print = () => { this.print = () => {
return this.heap.slice(1); return this.heap;
} }
// Only change code below this line // Only change code below this line