资源列表
plus
- 本实验实现的是链表结构的多项式相加，为数据结构必做实验，仅上传cpp文件，读者可在编译器上自行编译实现。-The experimental realization of the list structure of polynomial for the data structure must do the experiment, only upload cpp file, the reader can compiler to compile your own implementation.
tree
- 给定一个序列，按照顺序输入，构建一颗二叉搜索树。本实验为数据结构必做实验，仅提供cpp文件，读者可在编译器上自行编译实现。-Given a sequence of inputs in the order to build a binary search tree. In this study, the data structure must do the experiment, only cpp file, the reader can compiler to compile your own
queue
- 该实验实现了简单的优先级序列，为数据结构课程必做实验。-The experimental realization of a simple priority sequence for the data structure courses will do the experiment.
matrix
- 本实验实现了稀疏矩阵的转置，为数据结构必做实验，仅提供cpp文件，读者可在编译器上自行编译实现。-The experimental realization of a sparse matrix transpose, the data structure must do the experiment, only cpp file, the reader can compiler to compile your own implementation.
list
- 本实验为广义表建立二叉树。本实验为数据结构必做实验，仅提供cpp文件，读者可在编译器上自行编译实现。-This experiment is the generalized table set up binary tree. In this study, the data structure must do the experiment, only cpp file, the reader can compiler to compile your own implementation.
2
- 数据结构实验，实现停车场管理操作，堆栈的使用和实现-Experimental data structure to achieve parking management operations, stack usage and implementation
BinTree
- 以二叉树表为存储结构，实现二叉树的先、中、后三种次序的递归和非递归遍历。-Table stored in a binary tree structure to achieve binary tree before, during and after the three kinds of order recursive and non-recursive traversal.
hfm
- 1.建立哈夫曼树 从终端输入字符大小n,以及n个字符和n个权值，建立哈夫曼树 2、编码 利用已建好的哈夫曼树，对输入的字符进行编码，并输出编码结果 译码：利用已建立好的哈夫曼树对输入的代码进行编码，并输出译码结果-(1) Establish the Huffman tree from the terminal input character size n, and n and n characters right value, establishes a Huffman tree
tu
- 分别以邻接表、邻接矩阵为存储结构，实现图的深度优先和广度优先遍历，分别输出每种遍历下的节点访问序列。-Respectively adjacent table, the adjacency matrix for the storage structure, to achieve depth-first and breadth-first traversal, respectively, each output node access under traversal sequence.
Mazepath
- 一个求解迷宫通路的程序。以一个M*N的长方阵表示迷宫，0和1分别表示迷宫中的通路和障碍。对任意设定的迷宫，求出一条从入口到出口的通路，或得出没有通路的结论。以链表作存储结构的栈类型非递归程序。-A path to solve the maze procedure. In an M* N' s long square maze, 0 and 1, respectively maze of paths and obstacles. For any set of the maze, find a
relation
- 输入集合和关系,转化成一个关系矩阵,并判断该关系有什么性质.有报告。-Input set and relationships into a relationship matrix, and determine what is the nature of this relationship have reported.
Simple-matching
- 简单算法的匹配，可以获取一长串字符串中某一小段字符串的位置-imple algorithm matching, can get a long list of a short string of a string