Heaps ascending and decending

Author: codeztech-atique

Datastructure/Non_Linear/Heaps/binaryHeap.js

@@ -14,6 +14,8 @@
 
 // Visual Algo - https://visualgo.net/en/heap?slide=1
 
+
+// ---- binaryHeap.js (CommonJS) ----
 class Heap {
   constructor(cmp = (a, b) => a - b) {
     this.data = [];
@@ -62,24 +64,20 @@ class Heap {
   #swap(i, j) { [this.data[i], this.data[j]] = [this.data[j], this.data[i]]; }
 }
 
-// Helpers to make min-/max- heaps quickly
-exports.minHeap = (cmp) => new Heap(cmp ?? ((a, b) => a - b));
-exports.maxHeap = (cmp) => new Heap(cmp ?? ((a, b) => b - a));
-
-// Create a min-heap
-const h = minHeap();
+const minHeap = (cmp) => new Heap(cmp ?? ((a, b) => a - b));
+const maxHeap = (cmp) => new Heap(cmp ?? ((a, b) => b - a));
 
-// Add numbers
-h.push(10);
-h.push(5);
-h.push(20);
-h.push(1);
+module.exports = { Heap, minHeap, maxHeap };
 
-console.log("Size:", h.size());     // 4
-console.log("Peek (min):", h.peek()); // 1
-
-// Pop numbers (always gives the smallest first)
-console.log("Pop:", h.pop()); // 1
-console.log("Pop:", h.pop()); // 5
-console.log("Pop:", h.pop()); // 10
-console.log("Pop:", h.pop()); // 20
+// If you want to keep a local demo in THIS file, guard it:
+if (require.main === module) {
+  const h = minHeap();
+  h.push(10); h.push(5); h.push(20); h.push(1);
+  console.log("Size:", h.size());
+  console.log("Peek (min):", h.peek());
+  console.log("Heaps are:", h.data);
+  console.log("Pop:", h.pop());
+  console.log("Pop:", h.pop());
+  console.log("Pop:", h.pop());
+  console.log("Pop:", h.pop());
+}

Datastructure/Non_Linear/Heaps/heapSortAsc.js

@@ -0,0 +1,17 @@
+// Your Heap class stays the same...
+
+const { minHeap } = require('./binaryHeap.js');
+
+function heapSort(arr) {
+  const h = minHeap();
+  for (const x of arr) h.push(x);
+  const out = [];
+  while (h.size()) out.push(h.pop());
+  return out;
+}
+
+const arr = [10, 5, 20, 1, 72, 33, 2];
+console.log("Original:", arr);
+console.log("Heap Sort Ascending:", heapSort(arr));
+
+module.exports = { heapSort };

Datastructure/Non_Linear/Heaps/heapSortDesc.js

@@ -0,0 +1,17 @@
+// Your Heap class stays the same...
+
+const { maxHeap } = require('./binaryHeap.js');
+
+function heapSort(arr) {
+  const h = maxHeap();
+  for (const x of arr) h.push(x);
+  const out = [];
+  while (h.size()) out.push(h.pop());
+  return out;
+}
+
+const arr = [10, 5, 20, 1, 72, 33, 2];
+console.log("Original:", arr);
+console.log("Heap Sort Decending:", heapSort(arr));
+
+module.exports = { heapSort };

Datastructure/Non_Linear/Heaps/practice.js

@@ -0,0 +1,14 @@
+class Heap {
+    constructor(cmp = (a, b) => ( a - b)) {
+        this.data = [];
+        this.cmp = cmp;
+    }
+
+    size() {
+        return this.data;
+    }
+
+    peek(val) {
+        return this.data[0];
+    } 
+}