修改PEB系统

将内存中的一段数据拷贝到另外一段内存中，要考虑其中的内存覆盖问题。-A section of the memory to copy data to another section of memory, it is necessary to take into account the memory coverage problems.

实现一个数据库的连接池，提高数据库的链接效率，同时还有利于平衡物理上的访问量。-Implement a database connection pool to improve the efficiency of the database links, while also help balance the amount of physical access.

C语言编写的标准链表模板。包含链表的9种基本操作，链表的创建，判断，结点的增加、删除、查找，链表的删除等。-C language linked list of standard templates. Contains the list of nine kinds of basic operation, list creation, judgments node to add, delete, search, delete, etc. the list.

数据库连接池的代码-database connection pool code

新手初学必备，不错的学习资料-（ 北大青鸟点卡销售系统 北大青鸟点卡销售系统 ）-Essential beginner novice

二叉树的动态链表存储结构及表示，二叉树的三种遍历算法（递归和非递归两类）运用二叉树三种遍历的方法求解有关问题-Binary tree structure and the dynamics of linked list is stored, said three kinds of binary tree traversal algorithms (recursive and non-recursive types) the use of three kinds of binary tree traversal of the method for solving the problem

算法设计于分析中的多段图问题，用VC编写应用动态规划的算法设计方法，利用最优性原理以及所获得的递推关系式求取最优决策序列，通过多段图的定义，找到由源点s到汇点t的最小成本路径，进而可以灵活解决可以用多段图描述的许多实际问题.-algorithm design in the analysis of many of the map, prepared with VC dynamic programming algorithm design, the optimum principle as well as the recursive relation to strike the optimal sequence of decision-making through more of the map defined by the source to find s t point to the Department of the minimum cost paths and further a flexible solution could spend more of the map describes the many practical problems.

与postgresql数据库结合的数据库水印软件包-Database watermark software pakage along with postgresql database

C 语言开发HNT格式数据库系统 -boosted the development of C language format database system

遍历是二叉树经常要遇到的一种操作.可以运用到二叉树结点计数,线索化二叉树,求二叉树的深度,表达式求值等算法中.在遍历的过程中,对结点的访问具有普遍的含义,可以是输出各结点的数据域信息,也可以是对结点作其他处理.另外,通过一次完整的遍历,可使二叉树中结点信息由非线性排列变为某种意义上的线性排列.也就是说,遍历操作使非线性结构线性化. -traverse binary tree is frequently encountered in a operation. Binary Tree can be applied to node count, clues of a binary tree, the binary tree for depth, in the expression evaluates such algorithm. the ergodic process, right node of the visit is universal meaning, it can be output in each node of data domain information, also be on the node for other treatment. Besides, a complete traversal, Binary enables information from the node into a nonlinear with a sense of linear order. In other words, Traversing operation nonlinear structure so linear.