按照前序非递归遍历二叉树，递归法将二叉树的左右子树互换...

求K阶斐波那契序列 一个难得的数据结构示例 有详细注解 适合正在学习数据结构的STU-For K-order Fibonacci sequence a rare example of data structure has detailed annotations are learning the data structure suitable for the STU

顺序栈的基本操作，一共9个，与吴伟民数据结构课本完全一致，用C实现-order stack the basic operation, a total of nine, and Xiulan WU Weimin textbooks data structure is fully consistent with achieving C

统计学生成绩表中各分数段学生人数，用列表框返回结果。-Statistics of student achievement scores above table the number of students, using the list box to return results.

矩阵连乘算法，实现几个矩阵相乘的最优顺序，并计算出复杂度-matrix continually multiply algorithm, achieving several matrix multiplication, the optimal sequence and calculated complexity

求和最大的子序列，采用动态规划算法，经典算法-sequences using dynamic programming algorithm, the algorithm classic

我自己编写的一个C++ kruskal最小生成树程序，希望可以对初学者有所帮助，错误难以避免，希望大家谅解 -I have written a C++ Kruskal minimum spanning tree procedure, hoping to be helpful for beginners, it is difficult to avoid errors, I hope everyone understanding

数据结构-次索引的建立-data structure-building meeting Index

二叉树的各种遍历。递归和非递归遍历以及层次遍历。-the binary tree traversal. And recursive and non- recursive traversal level traverse.

按前序遍历序列创建二叉树，并中序遍历二叉树、求二叉树高度-by creating a binary tree traversal sequence, and which preorder binary tree, seeking binary tree height

这是简单的 XML 序列化库的Delphi。所需的版本的Delphi > = 2010年。此库使用 RTTI。