数据结构算法大全，包含最短路径，最小生成树，凸包，各种排序，四种高精度运算，图论上的常用算法，以及树的各种算法...

字典树算法，可以很方便的实现多叉树，而且查找很方便，是ACM算法设计中常用的数据结构-Dictionary tree algorithm, can be very convenient multi-tree, and find very convenient is the design of ACM algorithms commonly used data structure

数据结构练习共18道。-data structure to practice a total 18.

二叉树的建立和遍历c++语言非递归和递归实现-The establishment and traverse binary tree c++ language implementation of non-recursive and recursive

文章详细讲解分支限界的基本思想，单元最短路径问题，装载问题，0-1背包问题，旅游售货员问题等。-Detailed article on the basic idea of branch and bound, the shortest path problem unit, loading issues ,0-one knapsack problem, travel salesman problem.

数据结构语言概述-language data structure outlined

简单的全排列与组合问题的递归解法，数据结构与算法中较基础的问题-simple combination with the full array of recursive method, data structure and algorithm based on the issues than

01背包问题最简单实现，可在其上做更多的扩展，不知道可否不用递归用堆栈-01 knapsack problem to achieve the most simple, can do more in its expansion, I do not know can not use recursive stack

中缀变后缀表达式求值：输入表达式，#为结束符(如1+2#），程序会自动给出后缀表达式，并给出最终计算结果。程序中部分地方有注释-Variable postfix infix expression evaluation: Enter the expression,# to end the character (eg, 1+2#), the program will automatically give postfix expression, and gives the end result. Some parts of the program annotated

java与access相连的api,其中包括一个建好的access数据库.-connected api, including the completion of an access database.

一个通用的oracle OCI开发程序包-A generic oracle OCI development package