递归算法求统计二叉树T中叶子结点的数目，数据结构常用算法...

数据结构　 哈希表应用-data structure Hash Table Application

这是一个自己实现的N皇后问题c++解法，请各位指教-This is an own implementation of the N Queens problem c++ solution

详细讲解四个排序算法，帮助大家理解~不过是英文版的哦~原汁原味~呵呵~-Elaborate on four sorting algorithms to help you understand the English version but oh ~ ~ genuine

希尔和归并排序，基于数据结构的相关知识。-Hill and merge sort, based on the data structure knowledge.

微软的三个连接数据库的包，连接数据库必需-Microsoft

含并、交和差运算的集合类型试验报告，这个报告是做计算机试验的标准样式，分为了7个模块。-containing, intersection and poor computing pool type test report, the report is made to the standard computer test pattern, divided into seven modules.

创建一棵二叉树，采用前序遍历的方法建立一棵树，传递的参数为一个指向结点的指针的指针，目的是为了解决传值的问题，输入@符号的时候，表示一棵子树结束线索化二叉树，寻找当前结点的后继结点，寻找当前结点的前驱结点，中序遍历 -create a binary tree using preorder before the establishment of a tree. transmission parameters of a point to the node pointer, the purpose is to solve the problem of traditional values, the importation of the @ symbol, said the end of a tree-binary tree of clues to find the current node"s successor nodes, for the current node precursor nodes, China preorder

简单介绍了一种数据结构的构建及其使用情况,-introduces a simple data structure of the building and its use,

该程序是分布计数排序，它是我所见过的各种排序方法中最快的，它的时间复杂度为O(n),但是这种排序适用于已知待排序列的上下限，并且如果上限与下限的差值比较大的话，空间消耗也比较大．-distribution of the program is counting sequencing, it is I have seen the fastest sorting methods, it"s time complexity of O (n), but this sort known to be applicable to sort out the range, and if the upper and lower limits of the relatively large margin, space consumption is relatively large.

简单的通讯录程序-simple correspondence procedures