tree

根据最常用的链表法进行huffman编码，可以手工预制权重，例如n=8的时候即可以在文件中写入，输出相应的编码结果(According to the most commonly used method of Chain Huffman coding, manual can be prefabricated weight, For example, n = 8 when it is written in the document, the output corresponding to the coding results)

以一个m*n的长方阵表示迷宫，0和1分别表示迷宫中的通路和障碍。设计一个程序，对任意设定的迷宫，求出一条从入口到出口的通路，或得出没有 通路的结论 (To an m* n the long square maze, 0 and 1, respectively maze of paths and obstacles. Design a program, for any set of the maze, find a path from the inlet to the outlet, or the conclusions drawn without passage)

大一c语言实验的所有源码以及实验报告报告(All source code and report experimental freshman c language)

大学软件工程数据结构课程设计二叉树实验三种遍历方法(curriculum design,structure data)

dijkstra算法，用于寻找已建立图的最短路径，是非常有用的一个算法(Dijkstra algorithm, has been established for finding the shortest path map is a very useful algorithm)

有向图的邻接表存储的实现，包括有向图的各种操作(Directed graph adjacency list storage implementation, including a variety of operations to the map)

数据结构中的一元多项式相加，多于考研算法实现很重要。后续部分将在后期上传！(The sum of Multinomial)

中科大数据结构全部上机实验的实验程序以及报告，内容包括多项式，图，栈，SQL语言……(All experimental procedures USTC data structures as well as reports on experiments, including polynomial, maps, stack, SQL language ......)

先序创建二叉树，将二叉树所有节点的左右子树交换，再先序遍历输出(create a binary tree in first order, exchange all the nodes of the binary subtree , then preorder output)

说明：  分别用堆栈和数组的方法实现任何进制的数制转换(Arrays were used to stack and method of implementation of any binary number system conversion )