数据结构ADT--简单的队列

```cpp
#pragma once
#include<iostream>
#include<string>

template<typename elem>
class queu{
private:
	elem *list=new elem[maxsize];
	int top;
	int back;
	int maxsize;
public:
	queu(int n) {
		maxsize = n;
		top = back = 0;
	}
	~queu() {
		delete list;
	}
	void push(elem n) {
		if (top == maxsize - 1)throw"wrong parameter";
		list[top] = n;
		top++;
	}
	elem pop() {
		if (back == top + 1)throw"wrong parameter";
		return(list[back++]);
	}
	void print() {
		for (int i = back; i <top; i++)
		{
			std::cout << list[i]<<" ";
		}
	}
	//输出top和back的值
	void get() {
		std::cout << "top=" << top << " " << "back=" << " " << back;
	}
};

这只是比较简单的队列嘻嘻