数据结构中的二叉树排序问题

vfp表单，设置操作员的权限。（压缩文件）-Probe form, a set of operator competence. (Compressed files)

用vb实现读取文本文件（程序里包含三种不同的实现方法），适合于初学者.-Vb read with the realization of a text file (program includes three different method), suitable for beginners.

约瑟夫环源代码,前中后序递归遍历二叉树-Josephus source code, before, during and after recursive traversal sequence binary tree

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

数据结构中关于二叉树的基本操作 包括其各种函数-Binary tree data structure on the basic operation of a variety of functions, including its

源树b，b树结构，删除，插入，相当于搜索，搜索功能的范围

数据结构作业题，堆栈和队的使用（大写字母表示魔王语言的词汇；小写字母表示人的词汇语言；魔王语言中包含括号）-Title data structure operations, the stack and force the use of (capital letters that devil language vocabulary lowercase letters that people s vocabulary language devil language contained in brackets)

在 C + + 包括堆栈行动像推流行组合拆分和输出中执行扩展的堆栈

模拟机场跑道上飞机起飞，VC实现，适合研究数据结构算法 -Simulated airport runway on the plane to take off, VC achieved, appropriate to study the data structure algorithms

哈夫曼树和哈夫曼编码： 从终端输入若干个字符及其对应的整数，将整数作为结点的权值，建立哈夫曼树，然后对各字符进行哈夫曼编码。最后打印哈夫曼树和对应的哈夫曼编码。 设计要求： ⑴ 哈夫曼殊和哈夫曼编码的存储表示参考教材事例 ⑵ 在程序中构造四个子程序为 ① 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