c++顺序表链表有关功能的实现.doc

#include iostreamusing namespace std;const int MaxSize=100;template class T //模板类class SeqList{public:SeqList() {length=0;} //无参构造函数SeqList(T a[],int n); //有参构造函数~SeqList(){} //析构函数int Length() {return length;} //求线性表长度T Get(int i); //按位查找int Locate(T x); //按值查找void Insert (int i, T x); // 插入函数T Delete(int i); //删除函数void PrintList(); //遍历线性表，按序号依次输出各个元素。private:T data[MaxSize];int length;};templateclass T?SeqListT::SeqList(T a[],int n) //有参构造函数{if(nMaxSize)throw参数非法;for(int i=0;in;i++)data[i]=a[i];length=n;}template class Tvoid SeqListT::Insert(int i,T x) //插入函数{