-
Notifications
You must be signed in to change notification settings - Fork 2
/
heap.js
130 lines (103 loc) · 2.06 KB
/
heap.js
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
/*
* Copyright (c) 2016-present, IBM Research.
* Licensed under The MIT License [see LICENSE for details]
*/
'use strict'
function left (i)
{
return 2*i + 1;
}
function right (i)
{
return 2*i + 2;
}
function parent (i)
{
return Math.floor (i/2);
}
function Heap()
{
this.data = [];
}
Heap.prototype.push = function(a)
{
this.data.push (a);
this.bubbleUp ();
}
Heap.prototype.pop = function()
{
if (this.data.length === 0)
{
return false;
}
this.data[0] = this.data [ this.data.length - 1 ];
this.data.splice(this.data.length - 1);
this.heapify ();
return true;
}
Heap.prototype.top = function()
{
if (this.data.length > 0)
{
return this.data[0];
}
else
{
return null;
}
}
Heap.prototype.bubbleUp = function ()
{
let index = this.data.length - 1;
let parentIndex = parent(index);
let childValue = this.data[index];
let parentValue = this.data[parentIndex];
while (parentValue > childValue)
{
let tmp = childValue;
this.data[index] = parentValue;
this.data[parentIndex] = tmp;
index = parentIndex;
parentIndex = parent(index);
if (index === 0)
break;
childValue = this.data[index];
parentValue = this.data[parentIndex];
}
}
Heap.prototype.heapify = function ()
{
let index = 0;
let leftIndex = left (index);
let rightIndex = right (index);
let parentValue = this.data[index];
let leftChild = this.data[leftIndex];
let rightChild = this.data[rightIndex];
function minor (a, b)
{
return a < b ? a : b;
}
let minorValue = minor (minor (parentValue, leftChild), rightChild);
while (parentValue > minorValue)
{
this.data[index] = minorValue;
if (leftChild === minorValue)
{
index = leftIndex;
}
else
{
index = rightIndex;
}
this.data[index] = parentValue;
leftIndex = left (index);
rightIndex = right (index);
if (leftIndex >= this.data.length || rightIndex >= this.data.length)
break;
parentValue = this.data[index];
leftChild = this.data[leftIndex];
rightChild = this.data[rightIndex];
minorValue = minor (minor (parentValue, leftChild), rightChild);
}
}
module.exports = Heap;