我写的数据结构小程序是关于排序算法的，功能比较全

根据一棵二叉树结点的先根序列和中根序列构造该二叉树，并输出该二叉树的后序遍历结果。-According to a binary tree the root node of the first sequence and the sequence structure of the tree root and post the output of the binary tree traversal results.

数据结构的课后练习-Data structure of the after-school practice

在计算机科学中，链表是；

打开数据库中的记录，并且实现浏览数据库的功能-open the records in the database and view the database

矩阵求逆的c++程序,用来算大规模带分数形式的逆矩阵的,文件输入-matrix inversion c procedures for the large-scale Daibanshu form of the inverse matrix, the file input

一个解码的类，常用在条形码的解码中，是老外写的比较实用-a decoder category, commonly used in bar code decoding, the foreigner is more practical writing

rPm数据库的安装包 很好的希望大家喜欢有帮助的-rpm database of installed packages good hope that we like to have help

班级通讯录c++编写-preparation classes directory c

1. 输入字符序列，建立二叉链表。 2. 中序遍历二叉树：递归算法。 3. 中序遍历二叉树：非递归算法。 4. 求二叉树的高度。 5. 球二叉树的叶子个数。 6. 将二叉链表视为森林的孩子兄弟链表，计算森林中叶子个数。 7. 建立中序线索二叉树，并实现中序遍历。 8. 借助队列实现线索二叉树的层次遍历。 -tree

求图的任两结点间的距离，(2) 用二维数组存放C和A ，C是原成本矩阵，A 是求出的距离矩阵 (3) 算法采用三重循环，其中最外层的循环变量必须代表中间结点，中层的循环变量代表头结点而内层循环变量代表尾结点。 (4) 试着把三层循环变量的顺序作些改变，最外层的循环变量仍代表中间结点，而中层循环变量代表尾结点，内层循环变量代表头结点。把两种做法所得结果作比较,看结果是否相同 (5) 显示结果要清晰易懂 (6) 本题运行结果 -Order to map any of the distance between two nodes, (2) with two-dimensional array of storage C, A, C is the original cost matrix, A is to find the distance matrix (3) The algorithm uses the triple loop, one of the most outer loop variable must be representative of intermediate nodes, the middle loop variable represents the first node and the inner loop variable represents the end nodes. (4) tried to three-loop order of the variables to make some changes, the most outer loop variables still represent intermediate nodes, while the middle loop variable represents the end nodes, the inner loop variable represents the first node. The two approaches to compare the results to see whether the results the same (5) shows the results must be clear and understandable (6) The q