bfs

Monkeys and peach,Monkeys and peach(Monkeys and peach)

堆栈实现C++,以VC++环境为准——逍遥大洋至上(The stack of the C++, VC++ environment will prevail)

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

霍夫曼编码实验报告，内含源代码，编码原理 (Huffman coding lab report, containing the source code, coding theory)

分析汉诺塔，选择合适方法编程实现汉诺塔问题的解答。(Analysis of the Tower of Hanoi, select the appropriate method of programming the answers of the Tower of Hanoi problem.)

使用C++/C语言实现的红黑树，对于数据结构的学习有所帮助。(Use red-black tree C++/C language for learning data structures helpful.)

数据结构中插入排序，堆栈排序等的用法还有希尔排序(Data structure insertion sort, stack, sort, etc. use well sorted Hill)

使用非递归的方法遍历二叉树，可以直接运行。( Non-recursive binary tree traversal.)

数据结构c语言版，图的遍历，周游世界，无向图的遍历，包含14个国家。(Data structure c language version, graph traversal, travel around the world, undirected graph traversal, including 14 countries.)

说明：  操作系统先来先服务调度算法模拟（C描述）(Operating a first-come first-served scheduling simulation (C description))