一个包装好的树型模板类,可以实例化树型数据结构.

数据结构算法演示-demonstration algorithm data structure

ubudjet est 联合国 logiciel 德管理学院杜预算人员 管理学院院 déponses par

严慰敏，吴伟民版数据结构树上算法的具体实现c++版本-Yan Wei Min, Xiulan WU Weimin version of the tree data structure to achieve the specific algorithm c version

该系统允许注册新出租，改变现有的租金数据、 删除文件压缩的租金 按主索引键和辅助键搜索。

小型图书馆管理系统！-little books management system

对二叉树进行插入，打印屏幕等操作。使用动态结构实现，可以学习。代码简洁明了，便与学习。有注释。插入元素，采用递归实现。在t节点插入元素x；深度是temp；num表示若是在满二叉树情况下的编号，用于计算坐标;计算深度是x，满二叉树编号是y点的坐标。

该源码功能是实现赫夫曼编码，即构造最优二叉树，是字符界面的，自我感觉做的还不错，调试通过的，绝对好用-The source function is to realize Huffman coding, that is, the optimal tree structure is a character interface, and the sense of self, to do good, debugging adopted, the absolute ease of use

文件管理系统1.0Bjsp-document management system 1.0Bjsp

八 方块移动游戏要求从一个含8个数字（用1-8表示）的方块以及一个空格方块（用0表示）的3x3矩阵的起始状态开始，不断移动该空格方块以使其和相邻的方 块互换，直至达到所定义的目标状态。空格方块在中间位置时有上、下、左、右4个方向可移动，在四个角落上有2个方向可移动，在其他位置上有3个方向可移 动。例如，假设一个3x3矩阵的初始状态为： 8 0 3 2 1 4 7 6 5 目标状态为： 1 2 3 8 0 4 7 6 5-Eight-box requirements of mobile games from one containing eight numbers (1-8 with express) the box, as well as a space box (with 0) of the 3x3 matrix of the initial start, and constantly move the box to make space its adjacent box and swap until they reach their defined target state. Spaces in the middle position box has the upper and lower, left and right direction of four removable, in the four corners there are two directions can be mobile, in other locations has three movable direction. For example, suppose a 3x3 matrix of the initial state as follows: 803,214,765 target state as follows: 123,804,765

用delphi实现的各种排序算法，图形界面，可实现插入排序、交换排序、选择排序、合并排序以及基数排序-used to achieve the various sequencing algorithms, graphical interface, insert can be realized, in order of ranking exchange, SELECTION SORT, the merger sort of base sequencing