#include#includetypedef char dataType;struct TreeNode{ dataType data; TreeNode *left,*right; };//创建二叉树void CreateTree(TreeNode *&t,dataType x){ dataType d; scanf("%c ",&d); if(d == x){ t

#include#includetypedef char dataType;struct TreeNode{ dataType data; TreeNode *left,*right;};//创建二叉树 void CreateTree(TreeNode *&t,dataType x){ dataType d; scanf("%c ",&d); if(d == x){ t

#include#include#include#define N 20//直接插入排序void InsertSort(int a[],int n){ int i,j,temp; for(i=1;i<N;i++){ temp = a[i]; j = i-1; while(j>=0 && a[j]>temp){ a[j+1] = a[j]; j--; } a[j+1]

#include#include#define maxsize 100typedef char Vertextype;typedef struct{ Vertextype vexs[maxsize]; int edge[maxsize][maxsize]; int e,n;}Graph;//得到图的第i个顶点的值Vertextype GetValue(Graph *g,int

#include#include#define Maxsize 100typedef char dataType;struct TreeNode{ dataType data; TreeNode *left,*right;};void CreateTree(TreeNode *&t,dataType x){ dataType d; scanf("%c ",&d); if(d

#include#include#define Maxsize 100typedef int dataType ;typedef struct { dataType data[Maxsize]; int front,rear;}Sequeue;//创建队列Sequeue *createQueue(){ Sequeue *q = (Sequeue *)malloc(sizeof

实验主要要通过产生随机数进行数据的一次排序#include#include#include#define N 20//冒泡排序1---从前往后的冒泡排序 void bubble1(int a[],int n){ int i,j,t; for(i=1;i<n;i++){ for(j=0;j<n-i;j++){ if(a[j]>a[j+1]){ t = a[j];

#include#include#define maxsize 100typedef int dataType;typedef struct{ dataType data[maxsize]; int top; }Seqstack;//创建顺序栈Seqstack *CreateStack(){ Seqstack *t = (Seqstack*)malloc(sizeof(Seqs

实验效果

运行结果如下：

方法一:#include#include#define Maxsize 100typedef int dataType;typedef struct{ dataType data[Maxsize]; int top;}SeqStack;//创建顺序栈SeqStack *createStack(){ SeqStack *s = (SeqStack*)malloc(sizeof

实验内容1.初始化链队列2.判断队列是否为空3.元素x进队列4.出队列5.取队头元素6.取队尾元素7.求队列元素个数8.打印队列元素#include#includetypedef int dataType ;struct node{ dataType data; struct node * next;};typedef struct { stru

#include#include#include typedef int dataType;typedef struct node{ dataType data; struct node *next;}LinkStack;//初始化顺序栈LinkStack *InitStack(){ LinkStack *t = (LinkStack*)malloc(size