使用汇编写的二叉树遍历，我用的是按层存储算法，容易理解...

运动会分数统计,我的课程设计,用c语言编写的,-Games Score statistics, my curriculum design, with c languages,

哈夫曼树和哈夫曼编码： 从终端输入若干个字符及其对应的整数，将整数作为结点的权值，建立哈夫曼树，然后对各字符进行哈夫曼编码。最后打印哈夫曼树和对应的哈夫曼编码。 设计要求： ⑴ 哈夫曼殊和哈夫曼编码的存储表示参考教材事例 ⑵ 在程序中构造四个子程序为 ① int createhtree(HTree *t) /*根据输入的字符及其权值建立哈夫曼树*/ ② void coding(HTree *t, char *code) /*对哈夫曼树进行编码*/ ③ void printhtree(HTree *t, int* path) /*中序打印树*/ ④ void printcode(HTree *t) /*输出个字符的哈夫曼编码*/ -Huffman tree and the Huffman coding: input from the terminal a number of characters and their corresponding integer, will be an integer as node weights, the establishment of Huffman tree, and then on the characters Huffman. Finally print Huffman tree and the corresponding Huffman. Design requirements: ⑴ Huffman and Huffman coding is that the reference materials storage ⑵ examples constructed in the procedure for the four subroutines ① int createhtree (HTree* t)/* input characters in accordance with its right value the establishment of Huffman tree*/② void coding (HTree* t, char* code)/* Huffman tree to encode*/③ void printhtree (HTree* t, int* path)/* Pri

项目描述: SQLite is a small C library that implements a self-contained, embeddable, zero-configuration SQL database engine. Features include- Project description: SQLite is a small C library that implements a self-contained, embeddable, zero-configuration SQL database engine. Features include

难得的好程序，是有关数据库的-rare good procedure, the database

线性表 约瑟夫环-Josephus Linear List

其贷款和会计一体化合作体系开发这种教育贷款管理系统的最后一年的项目的主要目的是为学生的教育提供银行贷款。现在很多不贫穷的人们为他们的孩子提供更好的教育，因为财务问题，但这种帮助。NET基础贷款管理中的应用可以申请助学贷款，他们的孩子。学生可以以银行贷款利率低利用Web应用程序。这是VB6  ； 开发项目与当地基础数据库。本项目建筑跟任何学生应通过登记表登记出现在首页就可以查看不同的银行为教育提供贷款，如果他/她发现任何银行提供贷款的低利率，他们可以申请贷款，特别是银行，最后应用程序的管理员可以发布贷款转移到他/她的账户的钱。

c语言编写的哈夫曼程序,运行通过的!根据输入构建哈夫曼树.-prepared by Huffman, the running through! According to the importation of construction Huffman tree.

数据结构 二叉树算法集合为学习数据结构的同学提供帮助　互相交流-binary tree data structure set for the learning algorithm data structure to help students exchange

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

创建一棵二叉树，采用前序遍历的方法建立一棵树，传递的参数为一个指向结点的指针的指针，目的是为了解决传值的问题，输入@符号的时候，表示一棵子树结束线索化二叉树，寻找当前结点的后继结点，寻找当前结点的前驱结点，中序遍历 -create a binary tree using preorder before the establishment of a tree. transmission parameters of a point to the node pointer, the purpose is to solve the problem of traditional values, the importation of the @ symbol, said the end of a tree-binary tree of clues to find the current node"s successor nodes, for the current node precursor nodes, China preorder