摘要： #include<iostream>#include<vector>using namespace std;const int Max=30;class Node{public: Node(int d):data(d),left(NULL),right(NULL){} int data; Node *left; Node *right;};template<class T>class queue{public: queue(int i=Max):front(0),rear(0){Q=new T[Max];} void EnQueue(Node *p){Q[r 阅读全文