001

二叉树的中序遍历，先序遍历以及后序遍历的算法(Binary tree in preorder traversal, preorder traversal and postorder traversal algorithm)

用c++实现的haffman tree 小程序，仅供参考 。 (The the haffman tree applet realized with c++ for reference only.)

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

数据结构的课程设计，做的是一个交通查询，主要用到图的算法，和大家共享，欢迎指正！(Data structure curriculum design, do a query traffic, mainly used graph algorithms, and share, please correct me!)

说明：  四路归并排序，将原有的二路归并排序改编的四路归并排序(The four-way merge sort to the original way merge sort adaptation of the four-way merge sort)

数据结构与程序设计中的重点例子程序：八皇后问题(Data structure and procedures of the focus of the design example of the procedure: eight queen problem)

二叉树排序，二叉树的递归调用排序，属于C语言源码(Binary Tree Sort)

数据结构课设，城市地铁站的设计与使用规划(Set data structure class, subway station design and use of planning)

采用Dijkstra算法和Floyd算法实现的简单医院选址系统(data structure)

该代码实现了深拷贝的问题，对于深拷贝进行了一系列的介绍，并且显示其与浅拷贝的区别。(A deep copy of the code issues a series of deep copy for presentation, and shows the difference between a shallow copy.)