[考研]江西师范大学865考研数据结构单链表考点

#define _CRT_SECURE_NO_WARNINGS#include <iostream>#pragma onceusing namespace std;0.单链表结构体typedef struct Linknode {int info;struct Linknode* nex

[考研]江西师范大学865考研数据结构二叉树考点

0.二叉树结构体typedef struct treenode{struct treenode * lchild,rchild;int info;int tag;}*tree;0.二叉树的建立void buildtree(tree t){char ch;ch=getchar();if(ch='#')

[考研]江西师范大学865考研数据结构顺序表考点

0.结构体typedef struct SqlList {datatype data[MaxSize];int size;};0.打印顺序表void prin(SqList L) { for (int i = 0; i < L.length; i++) { printf("%d\t

[考研]江西师范大学865数据结构考研排序

0.结构体#define MAXSIZE 100typedef struct{int key;int other;}recordtype;typedef struct{recordtype r[MAXSIZE+1];int length;}table;1.直接插入排序//无哨兵插入排序void in

[考研]江西师范大学865数据结构字符串考点

0.结构体#define MAXSIZE 100type struct{char str[MAXSIZE];int length;}seqstring;1.朴素的模式匹配算法int index(seqstring p, seqstring t){int i, j, succ;i = 0; succ