tomasz
/
samples
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Adding better way of creating leftist heaps using queues.

master
Tomasz Półgrabia 2022-03-06 21:47:05 +01:00
parent e534becbde
commit 51aa461729
1 changed files with 21 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

24
2022/03/algorithms/leftist_heap.js
View File

@ -55,7 +55,7 @@ function pop_heap(heap) {
} }
function insert_heap(heap, val) { function insert_heap(heap, val) {
return merge_heap(heap, {value: val, height: 0}); return merge_heap(heap, {value: val, height: 1});
} }
let values = [10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0]; let values = [10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0];
@ -66,8 +66,26 @@ let heap = {root: null};
// heap.root = merge_heap(heap.root, {value: 3, height: 1}); // heap.root = merge_heap(heap.root, {value: 3, height: 1});
// heap.root = merge_heap(heap.root, {value: -1, height: 1}); // heap.root = merge_heap(heap.root, {value: -1, height: 1});
for (let el of values) { if (false) {
heap.root = merge_heap(heap.root, {value: el, height: 1}); // naive way of creating leftist heap
for (let el of values) {
heap.root = merge_heap(heap.root, {value: el, height: 1});
}
} else {
// better way of creating heap using queue
let queue = [];
for (let el of values) {
queue.push({value: el, height: 1});
}
while (queue.length > 1) {
let h1 = queue.shift();
let h2 = queue.shift();
let h = merge_heap(h1, h2);
queue.push(h);
}
heap.root = queue.shift();
} }
while (heap.root) { while (heap.root) {