BiTree

使用不同的方法解决背包问题：本算法采用的是动态规划方法，比较好的解决背包问题。(Use different methods to solve knapsack problem: The algorithm is a dynamic programming approach, a better solution to knapsack problem.)

这个程序是有关计算机的动态内存分配的数据结构 可以直接加载头文件与源文件即可使用其中的接口(This program is a data structure for dynamic memory allocation of the computer can directly load the header files and source files you can use one of the interfaces)

哈夫曼树可以使读者快速方便的查找所需文件(Huffman tree allows readers to quickly and easily find the file)

本程序是用c语言编写的在800位整数之间的乘积运算(This procedure is written in c the 800 integers in the product operation between)

题意:给你n个数,求出两两组合的最大公约数 类似打素数表的做法 (Meaning of the questions: to give you the number n, find greatest common divisor of a similar combination twenty-two hit the practice table of prime numbers)

单链表中的数据元素含有三种字符（字母、数字、其他字符），算法实现构造三个循环链表，是每个循环链表中只含有同一类字符，且利用原表中的结点空间作为这三个表的结点空间。(Singly linked lists of data element contains three characters (letters, Numbers and other characters), the algorithm constructs three circular linked list, each cycle list contains only the same type of character, and make use of the primary node space in a table as a node of the three table space.)

基于MFC平台，实现多功能计算器，可求解复杂表达式，主要实现为数据结构中链表和数组，对于要熟悉链表和数组的初学者有很帮助。(Based on the MFC platform, to achieve multi-function calculator, can solve complex expressions, the main realization of the data structure for the list and array, to be familiar with the list and the array of beginners helpful.)

C常用算法程序集，一些C语言的基本算法在里面都可以找到。(this is a very good book about c language,you will find it is very useful in your work.)

克鲁斯卡尔算法思想.cpp int seekedge(EDGE * (&a), int n) void bubble(EDGE * (&a), int size) void searchandjoin(EDGE * (&a1), int k) // a1是图边集头指针，a2是最小生成树边集的头指针，k为所要删的边 void storepicture(EDGE * (&a), int n, VERTEX *b, int m) (Thinking of Kruskal algorithm. Cpp int seekedge (EDGE* (& a), int n) void bubble (EDGE* (& a), int size) void searchandjoin (EDGE* (& a1), int k) // a1 edge set is the first pointer map, a2 is the minimum spanning tree of the first indicators margination, k for the edges to be deleted void storepicture (EDGE* (& a), int n, VERTEX* b, int m) )

数据结构二叉树，及其遍历，镜像，输出等相关操作C++源码。(Binary tree data structure and its traversal, mirror, output the operation C++ source.)