link list code

数据结构：有关树所有操作- Construction of data: The related tree all operates

我自己写的数值分析课程设计的源代码，这里是数值插值算法的内容。-I wrote it myself numerical analysis courses designed source code, here is the interpolation algorithm for the numerical content.

1.[问题描述] 编写递归算法，计算二叉树中叶子结点的数目 [输入] 按照先序序列的顺序输入该结点的内容。其输入abd eh cf i g . [输出] 按中序序列输出，输出的结果为；dbheaficg并计算出二叉树中叶子结点的数目为4 [存储结构] 采用二叉表存储 [算法的基本思想] 采用递归方法建立和遍历二叉树。首先建立二叉树的根结点，然后建立其左右子树，直到空子树为止，中序遍历二叉树时，先遍厉左子树，后遍厉右子树，最后访问根结点。根据左右子树的最后一个结点计算出二叉树中叶子结点的数目。 程序如下： #include #include #include"stdlib.h" -1. [Description of the issue] to prepare recursive algorithm, Binary calculation leaves the number of nodes [imported] in accordance with the first order input sequence in the order of the node contents. Input abd eh i g cf. [Output] by the order sequence output, the results of the output; dbheaficg calculated Binary leaf node to the number four [storage structure] Table 2 forks storage [ The basic idea algorithm] recursive method and traverse binary tree. First established binary tree root node, and then to build their son around the tree, the tree until the loopholes, which preorder binary tree, Li first times the left sub-tree, right af

它是一种软件，可以用于大型组织，追溯历史，很容易地更新员工信息及员工

回溯法 解决男女匹配问题 八男八女匹配-Backtracking address gender matching eight men and eight women match

数据结构课程设计，求无向网最短路径，利用c++6.0编程环境-data structure curriculum design, without seeking the shortest path to the net, using c 6.0 programming environment

严蔚敏编写的《数据结构》第9章的答案，全部为源码-the answers of chapter 9 of a book called ‘Data Structures’ writen by Yan Wei Min

sqlite官方并没有提供加密的功能，但提供了加密的接口。资源中的sqlite添加了加密功能。本加密算法采用XXTEA。如果使用Delphi连接此数据库，建议使用itwriting提供的sqlite wrapper改装版；资源包含有源代码以及编译成功的dll（编译工具：VC++ 2010。）各位可以下载后自行根据源码重新编译。

一个关于公式分析得java小程序，内含全部源代码和接口的详细使用说明，对于学习数据结构的朋友来说，有一定的研究价值。-on a formula of good things java small program that contains all the source code and interface use the detailed, data for studying the structure of a friend, a certain value for research.

给定n 个整数a ,a , ,an 1 2  组成的序列， a n i | |£ ，1 £ i £ n。如果对于i £ j ，有 0 = å = j k i k a ，则称序列区间i i j a , a , , a +1  为一个零和区间，相应的区间长度为j-i+1。-given n integers a, a, and an 1 2