m0_58966334的博客

#include<iostream> using namespace std; //双向循环链队 template<typename T> class node { public: node() { data = NULL; next = nullptr; from = nullptr; } node(T _data) { data = _data; next = nullptr; from = nullptr; } T data; node* next; .

#include<iostream> using namespace std; //循环顺序队列 template<typename T> class listQueue { public: listQueue(int _max = 10) { max = _max; Q = new T[max]; tail = 0; head = 0; length = 0; } ~listQueue() { delete[] Q; } //入 void inPut(T elem.