Detyra 3

Detyra 3
public class LQueue {
    
    public class Node {
        Object data;
        Node next;
        
        public Node(Object d) {
            data = d;
            next = null;
        }
    }
    
    Node front; //nyja e pare qe eshte shtuar ne queue
    Node rear; //nyja e fundit qe eshte shtuar ne queue
    int size; //numri i nyjeve ne queue
    
    public LQueue() {
        //fillimisht queue eshte e zbrazet
        front = rear = null;
        size = 0;
    }