weixin_44367041的博客

#include <iostream> using namespace std; template <class T> class arrayList { private: int length; int MaxSize; T* elem; public: arrayList(int LMaxSize);//构造函数 ~arrayList();//析构函数 arrayList<T>& Insert(int k, const T& x);//

#include <iostream> using namespace std; template<class T> class LinkNode {//结点类 template <class T> friend class LinkList;//将链式表类声明为友类 public: LinkNode() { next = NULL; }//构造函数 private: T data; LinkNode<T> *next;//指向下一节点的指

#include <iostream> using namespace std; template<class T> //顺序栈类 class LinearStack { public: LinearStack(int LSMaxSize); //构造函数，创建空栈 ~LinearStack();//析构函数，删除栈 bool IsEmpty();// 栈空返回true，非空返回false bool IsFull();//栈满返回true，不满返回false //int G

#include <iostream> using namespace std; template <class T> class LinkNode { template <class T> friend class LinkStack; public: LinkNode() { next = NULL; } private: T data; LinkNode<T>* next; }; template <class T>

#include <iostream> using namespace std; template <class T> class LinearQueue { public: LinearQueue(int LQMaxSize); ~LinearQueue(); bool IsEmpty(); bool IsFull(); bool Insert(const T& x); bool GetElement(T& x);//将队头元素的值放入x中 boo

#include <iostream> using namespace std; template <class T> class LinkedNode { template <class T> friend class LinkedBinTree; public: LinkedNode() { m_pLeftChild = m_pRightChild = NULL; } LinkedNode(const T& x) { m_pLeftChi

#include <iostream> using namespace std; template <class T> class LinkNode { template <class T> friend class LinkQueue; public: LinkNode() { next = NULL; }; private: T data; LinkNode* next; }; template <class T> class Lin

manage.h #include <iostream> #include <fstream> #include <string> using namespace std; //学生 template <class T> class Student { template <class T> friend class StudentManage; public: Student() { next = NULL; } private: i