1、线性表 1.1 顺序表–LinearList.h #ifndef DATA_STRUCTURE_LINEARLIST_H #define DATA_STRUCTURE_LINEARLIST_H #include <iostream> using namespace std; template<class T> class LinearList { public: LinearList(int LLMaxSize); ~LinearList(); LinearList<T>& Insert(int k,const T& x); bool IsEmpty() const; int GetLength() const; bool GetData(int k,T& x); bool ModifyData(int k,const T&X); int Find(const T&x); LinearList<T>& DeleteByIndex(int k,T&x); LinearList<T>& DeleteByKey(const T& x,T& y); void...