摘要: #include <iostream> using namespace std; struct Node//定义双向链表,方便降幂输出 { int C; int index; struct Node*prior; struct Node*next; }; void init(struct Node* 阅读全文
posted @ 2022-07-19 09:09 霖霖的信箱 阅读(297) 评论(0) 推荐(0)
摘要: #include<iostream> using namespace std; #define MaxInt 32767 #define MVNum 100 int i,j,k; typedef struct { char vexs[MVNum];//顶点表 int arcs[MVNum][MVNu 阅读全文
posted @ 2022-07-19 09:07 霖霖的信箱 阅读(189) 评论(0) 推荐(0)
摘要: #include<iostream> using namespace std; typedef struct Node{ char data; struct Node *lchild,*rchi ld; }BTreeNode,*BTree; void InitBT(BTree &BT)//初始化二叉 阅读全文
posted @ 2022-07-19 09:06 霖霖的信箱 阅读(27) 评论(0) 推荐(0)
摘要: #include<iostream.h> #include<stdlib.h> #include<math.h> #define MAXSIZE 20 #define ERROR 0 #define OVERFLOW 0 #define OK 1 typedef int SElemType; typ 阅读全文
posted @ 2022-07-19 09:06 霖霖的信箱 阅读(23) 评论(0) 推荐(0)
摘要: #include<iostream.h> #define null 0; #define OK 1; #define ERROR 0; typedef int Status; typedef struct Node{//定义单链表存储结构 int data; struct Node *next; } 阅读全文
posted @ 2022-07-19 09:04 霖霖的信箱 阅读(145) 评论(0) 推荐(0)
摘要: #include<iostream.h> #include<stdlib.h> #define max 20 typedef struct{//储存结构 int key; char other; }elemtype; typedef struct{ elemtype *elem; int lengt 阅读全文
posted @ 2022-07-19 09:03 霖霖的信箱 阅读(149) 评论(0) 推荐(0)