docs(binary-tree): add binary heap implementation

Author: guilhermebkel

data-structures/binary-tree/BinaryHeap.js

@@ -0,0 +1,63 @@
+const Sort = require("../../algorithms/sorting/Sort")
+
+class BinaryHeap extends Sort {
+#itemsCount
+#items
+
+constructor() {
+super()
+
+this.#items = []
+this.#itemsCount = 0
+}
+
+insert(item) {
+this.#itemsCount++
+
+this.#items[this.#itemsCount] = item
+
+this.swimBinaryTreeNodes(this.#items, this.#itemsCount)
+}
+
+delMax() {
+const isEmpty = this.isEmpty()
+
+if (isEmpty) {
+throw new Error("This BinaryHeap is empty!")
+}
+
+const maxItem = this.#items[1]
+
+this.exchangeValues(this.#items, 1, this.#itemsCount)
+
+delete this.#items[this.#itemsCount]
+
+this.#itemsCount--
+
+this.swimBinaryTreeNodes(this.#items, this.#itemsCount)
+
+return maxItem
+}
+
+size() {
+const size = this.#itemsCount
+
+return size
+}
+
+isEmpty() {
+const isEmpty = this.#itemsCount === 0
+
+return isEmpty
+}
+
+*[Symbol.iterator]() {
+for(let i = 0; i < this.size(); i++) {
+const item = this.pop()
+
+yield item
+}
+}
+}
+
+module.exports = BinaryHeap

data-structures/binary-tree/BinaryHeap.test.js

@@ -0,0 +1,16 @@
+const assert = require("assert")
+const BinaryHeap = require("./BinaryHeap.js")
+
+const binaryHeap = new BinaryHeap()
+
+binaryHeap.insert(3)
+binaryHeap.insert(2)
+binaryHeap.insert(5)
+
+assert.deepEqual(binaryHeap.isEmpty(), false)
+assert.deepEqual(binaryHeap.size(), 3)
+assert.deepEqual(binaryHeap.delMax(), 5)
+assert.deepEqual(binaryHeap.delMax(), 3)
+assert.deepEqual(binaryHeap.delMax(), 2)
+assert.throws(() => binaryHeap.delMax())
+assert.deepEqual(binaryHeap.isEmpty(), true)