资源列表
7-2
- 分别以姓名顺序（从低到高）和年龄顺序（从低到高）将学生信息输出，每行输出一位学生的信息-Name order, respectively (from low to high) and age order (from low to high) student information will be output, the output of each student' s information line
7-3
- 编写一个程序，输入N个用户的姓名和电话号码，按照用户姓名的词典顺序排列输出用户的姓名和电话号码。-Write a program, enter N users of the name and phone number, user name of the dictionary according to the order of output the user' s name and phone number.
7-4
- 输入n(n>1)个正整数，每次将输入的整数插入到链表头部。-1表示输入结束。再输入一个正整数，在链表中查找该数据并删除对应的节点。要求输出进行删除操作后链表中所有节点的值。 -Enter n (n> 1) positive integers, each integer input into the list head.-1 Means end of input. Enter a positive integer, find the data in the list and delet
8-4
- 编写一个程序，接收用户输入的一个字符串(可以包含空格)，统计其中所有出现过的所有字符，并按照频率高低的顺序排列输出。频率相同的字符按输入顺序输出。-Write a program that receives user input a string (may contain spaces), all of which appeared in the statistics of all characters, and in accordance with the order of frequency
jgsdxsjjg
- 数据结构课程设计，最新版的，全格式-Data Structure Course Design
BagProblem
- 背包问题的贪心算法，可以解决N个背包的问题-bag problem,
MaxOfSubSegSum
- vc求最大子串和问题 分别采用分治法和蛮力法很好的解决了这个问题-vc find the largest substring and problems, and were used to divide and conquer a good brute force method to solve this problem
BinaryTree
- 二叉树的创建、遍历、以及左右子树交换，非递归遍历，叶子节点计算及线索树等完整程序. -BinaryTree:Create,preorder,inorder,postorder,treedepth，exchangetreeLR，ThreadingBiTree，and so on...
tree
- 可以建立huffman树，完成编码、解码、打印二叉树等功能-This is useful.
HuffmanCoding
- 哈夫曼编码，用C语言实现的. 包括说明文档，源码，和可执行文件-Huffman coding, implemented in C language
a
- 数据结构链表的相关操作，包括创建，删除，修改，输出，查找等一系列操作-Data structure linked list of related operations, including create, delete, modify, output, and a series of operations to find
delete-AVL-tree
- 武汉大学的数据结构C++版实验，要求实现AVL树结点删除-Wuhan University' s version of C++ data structure experiments required to achieve AVL tree node to delete