【数据结构】链式队列

main.cpp

#include <iostream>
#include "LinkQueue.h"

using namespace std;

int main() {
   
        LinkQueue<int> Q;
        Q.enQueue(1);
        Q.enQueue(2);
        Q.enQueue(3);

        Q.displayQueue();

        int d; //出队的元素
        Q.deQueue(d);
        Q.displayQueue();
        cout << "d=" << d << endl;
        cout << "length=" << Q.queueLength()<<endl;

        int f;
        Q.getFront(f);
        cout << "front=" <<f <<endl;

        Q.clearQueue();
        return 0;
    }

LinkQueue.h

//
// Created by 63400 on 2021/11/7.
//

#ifndef LULEARNER_LINKQUEUE_H
#