CEIA

简单的汉诺塔算法，采用归约算法的思想，实例是三个盘子，三个柱子(Simple HANOR algorithm)

X位赋0mintest是实现芯片功耗测试不确定位填充算法(X-bit chip is to achieve the power conferred 0mintest test uncertain bit stuffing algorithm)

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

这是BFS算法的实现。用C语言实现的。好好学习吧。(This is achieved BFS algorithm. Implemented using C language. Learn it.)

数据结构使用三叉链表表示的二叉树的基本操作(Data structures using the binary tree expressed in the trigeminal lists the basic operation of)

二叉树的先序遍历。采用递归实现。释放资源时用了后序遍历。(Preorder traversal of a binary tree. Recursive implementation. Release resources used after preorder.)

代码注重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 )

利用佛洛伊德算法计算节点之间的最短路径,用于复杂网络中计算平均路径长度(average path lengh)

单链表逆置的源码~提供了源码和源码说明~简单实用，适用于课堂作业程度(Reverse single linked list provides a set of source code source code and source code ~ ~ simple and practical instructions for classroom work degree)

数据结构作业－停车场管理(operating data structure-the car park management)