bfs

利用數據結構中的棧，實現19世紀著名數學家高斯提出的八皇后問題(Stack data structure, to achieve the eight queens problem of the 19th century, the famous mathematician Gauss)

代码注重B树插入、删除的算法逻辑，适用于 学习者研究B树实现的核心思想。代码中无庞杂的无关操作(focus on B-tree code insertion, deletion algorithm logic applies to B-tree research learners to achieve the core idea. The code has nothing to do with the complex operation )

以太网首部的一个c语言程序，代码功能是对设备要传送的帧进行排队(Ethernet header c language program code function is queued frames to be transferred to the device)

关于随机发牌算法的小程序，作为数据结构的大作业，开发环境是VC(Random licensing algorithm for small procedures, as big job data structures, the development environment is VC)

本代码提供一种非常简单且快速的哈夫曼编码方法。 (this code provide a very simple and rapid method of Huffman coding.)

有理数的算法，包括其加减乘除，启用的是单链表的形式来表达(Rational algorithms, including addition, subtraction, enabling a single-chain form of expression)

实现回溯算法，能解决八皇后问题等～～算法结果优化，时间复杂度较小(Implement backtracking algorithms can solve the eight queens problem, etc. ~ ~)

数据结构中的许多东西,包括头文件、例题、习题等等(Data structure many things, including the header files, examples, exercises, etc.)

选择排序的实现，是一种基本的排序方法，但是时间复杂度相对较大。(Select Sort realization, is sort of a basic, but relatively large time complexity.)

使用C语言完成党的霍夫曼编码，主要使用树的数据结构，作为巩固数据结构的练习(Using the C language to complete the party' s Huffman coding, the main use of the tree data structure, data structure as a consolidation exercise)