LQueueImplementation.cpp

#include <iostream>

using namespace std;


template <typename T>
struct node{
    T data;
    node* next;
};

template <typename T>
class LQueue
{
    node<T> *front, *back;

    void copy(LQueue<T> const& q)
    {
        back=NULL;
        if(!q.empty()){
            node<T>* p = q.front;
            while(p){
                push(p->data);
                p=p->next;
            }
        }
    }
    void clean(){
    while(!empty())
        pop();
    }
public:
    LQueue():front(NULL),back(NULL){}
    LQueue(LQueue const& q) : front (NULL), back(NULL){
    copy(q);
    }
    LQueue& operator=(LQueue const& q)
    {
        if(this != q)
        {
            clean();
            copy(q);
        }
         return *this;
    }

    ~LQueue(){
    clean();
    }
    bool empty() const{
    return back==NULL;
    }
    void push(T const& x){
    node<T>* p = new node<T>;
    p->data= x;
    p->next=NULL;
    if(!empty()){
        back->next = p;
    }else
    front = p;
    back = p;
    }
    T pop(){
    if(empty()){
        cerr<<"opit za izkliuchvane ot prazna opashka! \n";
        return T();
    }
    node<T>* p = front;
    T x = p->data;
    if(p == back){
        front = NULL;
        back = NULL;
    }else
    front = p->next;
    delete p;
    return x;
    }
    T head() const{
    if(empty()){
        cerr<<"opit za poglejdane v prazna opashka! \n";
        return T();
    }
    return front->data;
    }
};

int main()
{


    return 0;
}