一个简单的通讯录，是暑期的课程实践期间找的，感觉很好用，有查找，删除等功能1...

红黑树：输入：在同一目录下的redblacktree.txt文件中输入十个大于0的数值，每个数值中间用空格格开 数目可以大于十个，但是要求在源程序中改变＃define NUM 10 ，改成相应关键值各个数输出：按照先序输出红黑树，格式为：根节点。颜色（左子树。颜色，右子树。颜色），并输出此 树的黑高度，然后输入要删除的关键值，按回车后输出删除后的结果，并输出其高度。-RED-BLACK TREE : Admission : in the same directory under the file input redblacktree.txt greater than 0 10 digits each intermediate numerical grid with open spaces can be greater than the number 10, but requested change in the source# define NUM 10, the corresponding critical value into several different output : In accordance with the first sequence RED-BLACK TREE output format : nodes. Color (left subtree. Color, right subtrees. Color), and export of the black tree height and then delete the key to value, according to enter the output was the result of the deletion, and its high output.

mysql数据库操作BLOB型数据的范例-mysql database operations example BLOB data

各种常用的排序算法的演示程序， 以顺序表作为存储结构～～～～ 欢迎大家指正-A demo for different sort arithmetic,use qlist as store type. welcome ues and question

用Eclipse里面的SWT控件对连接数据库的实现 -Using Eclipse

动态规划入门问题：导弹防御 的解答与源程序，包含样例输入与输出-Introduction to dynamic programming problems: answers and the source of missile defense, including sample input and output

数据结构实验报告-experimental data structure report

数据结构C++语言描述--应用标准模板库-Data Structures C++ language description- Application of Standard Template Library

C++数据库管理源代码，连接数据库后，可直接调用里面的函数对数据库进行操作，有修改-C++ Database management source code, database connectivity, you can directly call the function inside the database operation, has modified

这是一个学生成绩管理系统，运行之后可对学生的基本资料，成绩进行各项操作！-This is a student performance management system, running on students beyond the basic information for the various operating results!

遍历是二叉树经常要遇到的一种操作.可以运用到二叉树结点计数,线索化二叉树,求二叉树的深度,表达式求值等算法中.在遍历的过程中,对结点的访问具有普遍的含义,可以是输出各结点的数据域信息,也可以是对结点作其他处理.另外,通过一次完整的遍历,可使二叉树中结点信息由非线性排列变为某种意义上的线性排列.也就是说,遍历操作使非线性结构线性化. -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.