#include <iostream>#include <iomanip>using namespace std;const int MAX_VERTEX_NUM = 20;typedef char VexType;//结点类型typedef struct ArcNode {int adjvex;//表内结点的点域部分，存储此处的顶点值struct ArcNode* nex

#include <iostream>using namespace std;typedef int ElemType;void SymmetricMatrixStore(int n, ElemType*& s);//存储n行的对称矩阵,将存储结果放入数组s中返回void TraverseSymmetricMatrix(ElemType* s, int n);//将存储在数组s

稀疏矩阵的三元组表示方式稀疏矩阵的转置#include <iostream>#include <iomanip>using namespace std;const int MAXSIZE = 100;typedef int ElemType;typedef struct {int i, j;//行列ElemType e;//值}Triple;//三元组typedef str

这个真的写了好久，所以单独发一章函数代码bool CreateBiTree(BiTree& T) {char ch; int flag = 0;//flag作为标记用，当flag=0时创建当前结点的左孩子，flag=1时创建当前结点的右孩子cin >> ch;if (ch == '#') {//如果根结点为空则创建结束T = NULL;return 1;}BiTree newn

#include <iostream>#include <iomanip>using namespace std;typedef int ElemType;typedef struct Node {ElemType data;struct Node* lchild, * rchild;//左右孩子}BiTNode;//二叉树结点typedef struct {BiTNode