SQLSERVER源代码

1．定义二叉树的链式数据结构。 2．编写函数，创建下图所示的二叉树。 3．编写函数输出二叉树的先序、中序、后序遍历。-1. The definition of binary tree data structure chain. 2. Write a function, create a binary tree as shown in figure below. 3. Write function, the output of the first binary sequence, in order, postorder traversal.

冒泡法排序C++实现的简便运算，可直接应用-Bubble sort C++ method to achieve an easy operation, can be applied directly

一个商品销售系统-a sales system

以visual studio 2005为开发环境的约瑟夫环设计。-Environment: visual studio 2005

大型数据库，最基本的PL/SQL语句，及其基础编程。-Large databases, the basic PL/SQL statement, and its basic programming.

用c做的图的数据结构的作业,建立有向图,深度广度搜索,分为递归和非递归方式.-C to do with the map data structure operations, the establishment has to map the depth of breadth of search, is divided into recursive and non-recursive way.

本桌面软件应用窗体，自定义菜单常用工具，数据表加密，树形控件等技术。新学者可以从中学习。人性化和个性化的界面设计，笑料十足，着实让人眼前一亮

内存池，如果需要减少长时间、不断开辟小内存的程序产生的内存碎片对程序运行效率的影响，可以使用该类库；-Memory pool, if the need to reduce the time, and constantly open up a small memory memory fragmentation procedures of the process the impact of operating efficiency, you can use the class library

一个效率还可以的配对堆 Fibonacci Heap太难写了 配对堆可以有效替代Fibonacci Heap 附带了用它实现的Dijkstra 复杂度O(nlogn+e) -An efficient matching can also be hard to heap Fibonacci Heap wrote a pairing heap Fibonacci Heap can be an effective alternative to use it comes with the realization of Dijkstra complexity O (nlogn+ E)

在 C + + 包括节点和整个数据结构和 haffcode 执行完整的哈夫曼树