表达式求值是程序设计语言编译中的一个最基本问题，它的实现是栈的应用的典型例子。...

.Net显示了友好的人机界面，以及非常少量的原代码就能够完成所要的功能-. Net shows the friendly human-machine interface, as well as a very small amount of the original code to be able to complete the function of

哈夫曼树算法 根据给定的n个权值{w1,w2,……wn}，构造n棵只有根结点的二叉树，令起权值为wj 在森林中选取两棵根结点权值最小的树作左右子树，构造一棵新的二叉树，置新二叉树根结点权值为其左右子树根结点权值之和 在森林中删除这两棵树，同时将新得到的二叉树加入森林中 重复上述两步，直到只含一棵树为止，这棵树即哈夫曼树 -Huffman tree algorithm based on a given n-weights (w1, w2, ... ... wn), construct n trees only a root node of the tree, so that from the right value of wj in the forest root node to select two the right tree for the value of the smallest subtree around, a new binary tree structure, the right to buy a new tree root node value of its subtree root node around the right value in the forest and delete these two trees, At the same time, the new binary tree obtained by adding the forest to repeat the above two steps until a tree containing only the date, that is, Huffman tree tree

构造格雷码的分析程序，用于算法分析，用VC编写，可以构造n位的格雷码-Gray Construction Code Analysis Program for the analysis of algorithms, with VC preparation, can be constructed of n-Gray code

设置信号放大器，在包中有详细的代码说明及注释，通过树的数据结构实现信号放大器的设置~-Set-signal amplifier, in the package are detailed code descriptions and notes, through the tree data structure to achieve signal amplifier settings ~

我想要我的 soccerplay 团队在大学 geometry.h palayer.cpp,worldmodel 喜欢......pleaze 帮助我去此源免费获取某些利益来源

能够连接各种数据库的API-to connect to various databases API

一个数据结构，其中每个元素包含指向下一个和以前的内容在列表中，形成了双向线性名单。-A data structure in which each element contains pointers to the next and previous elements in the list, thus forming a bidirectional linear list.

完全基于ODBC API封装的数据库访问库源代码。可以支持主流数据库。接口间接，清晰。-Based entirely on the ODBC API package, database access library source code. Can support the mainstream databases. Interface, indirect and clear.

是数据结构书上的算法，都是比较经典的实现。-data structure is the book algorithm, which is a more classic realized.