资源列表
层次非递归遍历
- 数据结构中的常见算法，树的层次非递归遍历序算法，简单易懂-data structure of the common algorithm, the level of tree traversal sequence non - recursive algorithm, simple
中序遍历
- s数据机构中的常出算法，建树后实现中序遍历，从而实现其他的转化-s data agencies of the algorithm regular contribution to realization after the preorder, thereby realizing the transformation of other
树的建立及其深度
- 树结构是数据结构中最重要的结构。利用树可以实现遍历等要求。该算法用于建立树，才能实现其他的操作-tree data structure is the most important structure. Using tree traversal can be achieved, among others. The algorithm for the creation of the tree can be achieved by other operators
Prim算法构造最小生成树
- 数据结构中的prim算法构造最小树的算法。课程作业要求-data structure constructed Prim algorithm of most trees algorithms. Courses operational requirements
formulervalue
- 数据结构中的表达式求值运算算法实现。数据结构课的要求。-data structure of the expression evaluates computing algorithm. Course data structure requirements.
magic_1
- 魔方的算法,即每行每列和对角线上的数值和相等,算法值得研究研究-Magic Square algorithm, which means that every line and every out on the diagonal and the same numerical algorithm worth studies
exbitree
- 交换二叉数的左右孩子,如果只有一个孩子则把它移到另一边-exchange of the two forks around a few children, if only one child put it moved to the other side
中缀表达式求值
- 中缀表达式求值,运用了堆栈进行存储,并支持小数的计算-expression which evaluates superintendent, the use of stack for storage, and support for the calculation of the minority
K1
- hanoi塔经典问题，采用递归算法,值得研究研究-Hanoi tower classic, using recursive algorithm, it is worth studies
经典算法
- 最经典的C算法,有简单的也有难的,算法极其精妙-classic C algorithms, it is simple difficult, the algorithm is extremely exquisite
排序算法－java
- 用java实现的数据结构排序算法，包括：选择排序、插入排序、冒泡排序、希尔排序、快速排序、堆排序、归并排序。-used to achieve the ranking algorithm data structure, including : Select, in order of insertion sequence and Bubble Sort, Hill sequencing, rapid sequencing, heap sort, merging sequencing.
PI的编程
- 求pi的程序，包括实验报告，误差分析，收敛性分析-for pi procedures, including experimental report, error analysis, convergence analysis, and so on