class Node:

    def __init__(self, data):

        self.data = data

        self.next = None

​

class Queue:

    def __init__(self):

        self.front = None

        self.rear = None

        self.length = 0

    def enqueue(self, element):

        new_node = Node(element)

        if self.rear is None:

            self.front = self.rear = new_node

            self.length += 1

            return

        self.rear.next = new_node

        self.rear = new_node

        self.length += 1

    def dequeue(self):

        if self.isEmpty():

            return "Queue is empty"

        temp = self.front

        self.front = temp.next

        self.length -= 1

        if self.front is None:

            self.rear = None

        return temp.data

    def peek(self):

        if self.isEmpty():

            return "Queue is empty"

        return self.front.data

    def isEmpty(self):

        return self.length == 0

    def size(self):

        return self.length

​

    def printQueue(self):

        temp = self.front

        while temp:

#include <stdio.h>

#include <stdlib.h>

​

typedef struct Node {

    char data;

    struct Node* next;

} Node;

​

typedef struct {

    Node* front;

    Node* rear;

    int length;

} Queue;

​

Queue* createQueue() {

    Queue* newQueue = (Queue*)malloc(sizeof(Queue));

    newQueue->front = NULL;

    newQueue->rear = NULL;

    newQueue->length = 0;

    return newQueue;

}

​

void enqueue(Queue* q, char element) {

    Node* newNode = (Node*)malloc(sizeof(Node));

    newNode->data = element;

    newNode->next = NULL;

    if (q->rear == NULL) {

        q->front = q->rear = newNode;

        q->length++;

        return;

    }

    q->rear->next = newNode;

    q->rear = newNode;

    q->length++;

}

​

char dequeue(Queue* q) {

    if (q->length == 0) {

        printf("Queue is empty\n");

        return ' ';

    }

    Node* temp = q->front;

    q->front = temp->next;

    if (q->front == NULL) {

        q->rear = NULL;

public class Main {

    public static void main(String[] args) {

        Queue myQueue = new Queue();

        myQueue.enqueue('A');

        myQueue.enqueue('B');

        myQueue.enqueue('C');

        System.out.print("Queue: ");

        myQueue.printQueue();

        System.out.println("Dequeue: " + myQueue.dequeue());

        System.out.println("Peek: " + myQueue.peek());

        System.out.println("isEmpty: " + myQueue.isEmpty());

        System.out.println("Size: " + myQueue.size());

    }

}

​

class Node {

    char data;

    Node next;

    public Node(char data) {

        this.data = data;

        this.next = null;

    }

}

​

class Queue {

    Node front;

    Node rear;

    int length;

    public Queue() {

        this.front = null;

        this.rear = null;

        this.length = 0;

    }

    public void enqueue(char element) {

        Node newNode = new Node(element);

        if (this.rear == null) {

            this.front = this.rear = newNode;

            length++;

            return;

        }