哈夫曼树和哈夫曼编码： 从终端输入若干个字符及其对应的整数，将整数作为结点的权值，建立哈夫曼树，然后对各字符进行哈夫曼编码。最后打印哈夫曼树和对应的哈夫曼编...

栈的应用-表达式求值2                                                                                                                                                                                                           ..............................................................................................................................................................................

平衡二叉树生成 输入任意个节点 如 2 6 8 0为显示 可自动生成平衡二叉树 bf为平衡因子 h给深度 可插入删除 计算转动次数（wangliwei007也是我，质料没添全就换这个好号，请斑竹给我发个号好吗？我也想下载东西，急）-balanced binary tree generating arbitrary input nodes as 2 6 8 0 to demonstrate that automatically generates balanced binary tree bf for the balance factor to the depth h can be inserted delete calculated rotational frequency (wangliwei007 me, not Tim material on the whole good for this, please give me a 62-000, okay? I would also like to download something radical)

基于有限高斯混合模型的EM算法的源程序代码，里面有实验报告和运行结果。 -based on finite Gaussian mixture model of the EM algorithm source code, which has run reports and experimental results.

线性表常用算法集合，含所有线性表基本的算法，与吴伟民编的数据结构书完全配套，用TC实现，经过运行。-linear algorithm commonly used pool table, table containing all the basic linear algorithms, and Xiulan WU Weimin series of the data structure was fully complementary with TC realization, after running.

迷宫算法（maze） /* Maze * Starting point is m[0][0], need to find a path go to m[9][9]. 0 means OK, * 1 means cannot go there, boundary is 0 and 9, cannot go beyond boundary. * Each step can be made horizontally or vertically for one more grid (diagonal * jump is not allowed). * Your program should print a series of grid coordinates that start from m[0][0] * and go to m[9][9] * Hint: No need to find the shortest path, only need to find one path that gets * you to desitination. */ -/* Maze * Starting point is m[0][0], need to find a path go to m[9][9]. 0 means OK, * 1 means cannot go there, boundary is 0 and 9, cannot go beyond boundary. * Each step can be made horizontally or vertically for one more grid (diagonal * jump is not allowed). * Your program should print a series of grid coordinates that start from m[0][0] * and go to m[9][9] * Hint: No need to find the shortest path, only need to find one path that gets * you to desitination.

数据结构双链表的 例子-data structure-Chain example

xbcnv提示：你将获得积分（0-20）的基础上，你的产品质量

背包回溯法,初来乍到如有其他问题还请各位多多指教.-knapsack backtracking, just arrived at that if other issues also invited to the exhibitions.

队列相关的所有基本算法，西电的老师写的，与吴伟民数据结构课本完全一致，用C实现-cohort of all the basic algorithm, the West-- written by the teachers, and textbooks Xiulan WU Weimin data structure is fully consistent with achieving C

程序　请认真书写上传资料的详细功能、包含内容说明-ccbvcxb