Reyes Yang's Utopia

 //---------------------------------------ClassArrList.h-------------------------------------------------- template class arrList{                                       // 顺序表，向量private:              

  //-----------------------------------------------CirularQueue.h------------------------------------------------template class cirularQueue{private:int maxSize;int front;int rear;T *data;public:c

  *************************************************SparseMatrix.h***********************************************#include using namespace std;const int maxNum=100;template class Trituple{publ

//---------------------------arrStack.h-----------------------------------template class arrStack{private:                                    // 栈的顺序存储int mSize;                               // 栈中

  #include "iostream"#include "arrStack.h"                                                          //用到了上篇文章定义的顺序栈模板using namespace std;double fun(double x,double y,char op){switch(op){case +

//------------------------------------------ClassLinkList.h------------------------------------------template class linkList;template class Link{friend class linkList;private:        T data;     

//***********************************BinaryTree.h********************************************//此代码只实现了二叉树先序遍历的递归以及非递归算法，再就是层次遍历算法#include #include