你若盛开 清风自来

#include #include #define Stack_size 100typedef char ElemType;typedef struct Node{    ElemType elem[Stack_size];    int top;} Seqstack;void Initstack (Seqstack *s){    s->top=-1;

#include #include #include #include #include using namespace std;const int maxn = 1024;const int INF = 0x7fffffff;typedef pair P; //到这个点的最短路长度 和这个点int ans;struct edge //边的终点 和长度{ int

#include #include #define max_vertex_num 100 //最多顶点个数typedef char VertexData;typedef int AdjType ;typedef int OtherInfo ;typedef struct ArcNode{ int adj; //对于无权图 用1表示相邻 0表示不相邻 ；对于带权图，则为权值类型

#include #include #define max_vertex_num 100 //最多顶点个数typedef char VertexData;typedef int AdjType ;typedef int OtherInfo ;typedef struct ArcNode{ AdjType adj; //对于无权图 用1表示相邻 0表示不相邻 ；对于带权图，则为权值类

//二叉树的建立以及先序、中序、后序遍历算法 以及统计二叉树的叶子结点数目算法#include #include typedef char DataType;typedef struct Node{ DataType data; struct Node *LChild; struct Node *RChild;} BiTNode,*BiTree; //定义二叉树void

//层次遍历二叉树并输出结点的算法#include #include typedef struct NNode{ char data; struct NNode *LChild; struct NNode *RChild;} BiTNode,*BiTree; //定义二叉树结点和结点指针typedef BiTree QueueElementType;typedef str

#include #include typedef struct Node{ int data; struct Node * next;} Node,* Linklist; //定义链表的结点，链表头void Initlist (Linklist *L) //初始化链表{ *L=(Linklist)malloc(sizeof(Node)); (*L

#include #include typedef struct Node{ int data; struct Node * next;} Node,* Linklist; //定义链表的结点，链表头void Initlist (Linklist *CL) //初始化链表{ *CL=(Linklist)malloc(sizeof(Node)); (

#include #include typedef struct Node{ int data; struct Node * next;} Node,* Linklist; //定义链表的结点，链表头void Initlist (Linklist *L) //初始化链表{ *L=(Linklist)malloc(sizeof(Node)); (*L

#include #include typedef int QueueElementType;typedef struct Node{ QueueElementType data; struct Node *next;} LinkQueueNode; //定义队列结点typedef struct{ LinkQueueNode *front; //队列头结点

#include #include #define MAXLEN 100typedef struct{ char ch[MAXLEN]; int len;} SString;int SteInsert (SString *s,int pos,SString t) //在串s中下标为pos的字符之前插入串t;{ int i; if(poss->len)

#include "seqstack.h"#include "stdio.h"#include char ch;int ExpEvaluation()/*读入一个简单算术表达式并计算其值。operatsign和operatdata分别为运算符栈和运算数栈OPS为运算符集合*/{    char x,y;    char op;    int a,b,v;

//链栈的建立及其出栈入栈操作#include #include typedef int StackElementType ;typedef struct SNode{    StackElementType data;    struct SNode * next;} LinkStackNode,* LinkStack;  //定义链表的结点，链表头v

//哈弗曼编码的算法#include #include #include #define N 50//叶子结点的最大值#define M 2*N-1 //所有结点的最大值typedef struct{ int weight; int parent; int LChild; int RChild;} HTNode,HuffmanTree[M+1];