严蔚敏编写的《数据结构》第9章的答案，全部为源码

二叉树的先序，中序，后序，按层遍历算法。以中序输入，用‘#’代替叶子节点的子节点输入。-binary tree first sequence, sequence after sequence, layer by traversal algorithm. The order to import, use "#" instead of the leaf nodes for input nodes.

我用VFP编写的选股软件,要用胜龙6(DOS)的数据.-prepared by the Stoc k software, use Shenglong 6 (DOS) for more information.

数据结构导学》书上的源程序-data structure Learning Guide "book on the source

SD卡读卡器阿杜伊诺.qwewqewq eewq wq ew ewwq eqw eqwe wqe wqe wq ewqe wqe wqe wqe wqe wqe wqe wqe wqe wqe wqe wqe wqe wqe wqe wqe wqe wqe wqe wqe

资源描述一个控制台程序 用于学生信息管理  成绩计算等等

北大ACM1003（Hangover）-North ACM1003 (Hangover)

Libgist is an implementation of the Generalized Search Tree, a template index structure that makes it easy to implement any type of hierarchical access method (AM). -Libgist is an implementation of the Generalized Search Tree, a template index structure that makes it easy to implement any type of hierarchical access method (AM).

算法，钱币组合。可设定钱币种类数量，找出组合种数。-Algorithm, coin combinations. Can set the number of coin types, identify the combination of species.

树结构之线索话二叉树，二叉树的存储结构，线索二叉树的构造。中序线索化，递归算法，非递归算法。

这是研究生课程计算方法与技术中讲到的UnionFind算法的具体实现代码。-This is the post-graduate courses and technical calculation method described in UnionFind algorithm to achieve the specific code.