DSA: Linked Lists

// Circular Queue
class Node {
    constructor(data) {
        this.data = data;
        this.next = null;
    }
}

class CircularQueue {
    constructor(capacity) {
        this.capacity = capacity;
        this.head = null;
        this.tail = null;
        this.size = 0;
    }
    // enqueue
    // dequeue
    // displayQueue
}

// Simple Queue
class Node{
    constructor(){
        this.data = data
        this.next = null
    }
}

class Queue {
    constructor() {
        this.front = null;
        this.rear = null;
        this.size = 0;
    }
    // enqueue
    // dequeue
    // peek
    // isEmpty
}

// Stack
class Node {
    constructor(data) {
        this.data = data;
        this.next = null;
    }
}

class Stack {
    constructor() {
        this.top = null;
    }
    // push
    // pop
    // peek
    // isEmpty
}