MCPcopy Index your code
hub / github.com/TheAlgorithms/JavaScript / print

Method print

Data-Structures/Heap/MinPriorityQueue.js:54–56  ·  view source on GitHub ↗
(output = (value) => console.log(value))

Source from the content-addressed store, hash-verified

52
53 // prints the heap
54 print(output = (value) => console.log(value)) {
55 output(this.heap.slice(1))
56 }
57
58 // heap reverse can be done by performing swapping the first
59 // element with the last, removing the last element to

Callers 1

Calls 2

outputFunction · 0.85
logMethod · 0.45

Tested by

no test coverage detected