GPD2021

class MinHeap { constructor() { this.heap = []; } empty() { if (this.heap.length == 0) { return true; } return false; } swap(arr, x, y) { let temp = arr[x]; arr[x] = arr[y]; arr[y] = temp; return; } insert(value) { this.heap.push(value); this.bubbleUp(); } bubbleUp() { let currentIndex = this.heap.length - 1; while (currentIndex > 0) { const parentIndex = Math.floor((currentIndex - 1) / 2); if (..

class MaxHeap { constructor() { this.heap = []; } swap(arr, x, y) { let temp = arr[x]; arr[x] = arr[y]; arr[y] = temp; return; } empty() { if (this.heap.length == 0) { return true; } return false; } insert(value) { this.heap.push(value); this.bubbleUp(); } bubbleUp() { let currentIndex = this.heap.length - 1; while (currentIndex > 0) { const parentIndex = Math.floor((currentIndex - 1) / 2); if (..

class Node{ constructor(item){ this.item = item; this.prev = null; this.next = null; } } class Deque{ constructor(){ this.head = null; this.tail = null; this.length = 0; } push_front(item){ const node = new Node(item); if(this.size()==0){ this.head = node; this.tail = node; }else{ this.head.prev = node; node.next=this.head; this.head = node; } this.length+=1; } push_back(item){ const node = new ..

class Node{ constructor(item){ this.item = item; this.next = null; } } class Queue{ constructor(){ this.head = null; this.tail = null; this.length = 0; } push(item){ const node = new Node(item) if(this.head==null){ this.head= node; }else{ this.tail.next = node; } this.tail = node; this.length +=1; } pop(){ const popItem = this.head; this.head = this.head.next; this.length -=1; return popItem.ite..

class Node{ constructor(item){ this.item = item; this.next = null; } } class Stack{ constructor(){ this.topOfStack = null; this.length = 0; } push(item){ const node = new Node(item); if(this.topOfStack!=null){ node.next = this.topOfStack; } this.topOfStack = node; this.length+=1; } pop(){ if(this.length==0)return -1; const popItem = this.topOfStack; this.topOfStack = popItem.next; this.length-=1..