Delphi XML序列化库

清华大学版数据结构的一下试题资料，望对大家有帮助-Tsinghua University, version data structure questions about the information, hope for all of us help

数据结构算法之 约瑟夫算法-data structure algorithms Joseph Algorithm

一个二叉树的三叉链表运用实例，求出叶子的结点并输出从根结点到该叶子结点的路径!-a binary tree using the trigeminal Chain example, the leaves are obtained and the output node from the Root of leaf nodes in the path!

linux核心数据结构-core data structure

数据结构及算法 对于参加ACM的学生有一定帮助 里面有详细的解答-Data structure and algorithm for ACM students to participate in some help there are detailed answers

这个是Hilbert曲线的实现算法,可以具体演示出每级曲线的绘制过程,最多可实现8级曲线的绘制.-Hilbert Curve is the realization of the algorithm can be demonstrated that each specific grade curve of the process of drawing up to achieve eight curve drawing.

数据结构编写管理系统-prepared data structure management system

用C++ 包装了大整数这个类，超级大的整数现在也可以用了。-With C++ Packaging a large integer in this category, the super large integer can be used now.

声明结构 体，该结构体包含一个值，和一个指向下一个结点的指针next,初始化时头结点指针指向自身，每增加一个节点，使加入的结点的next指针指向头结点，使t头结点的next指针指向插入结点。 源代码 在vs2012 运行通过，界面使用菜单进行操作选择，友好方便，值得参考

思想很简单，就是一个循环链表 但要说明的是：我之所以用clist(1)来初始化，主要是我刚开始编的时候没打算解决约瑟夫环，只是想编一个带表头的循环链表，然后我用从这个程序改过来的，所以代码可以进一步优化。-Thinking is very simple, that is, a cycle list but would like to note is: I use clist (1) to initialize, mainly because I had just started when Joseph did not intend to resolve the ring, just want to provision a table with the head circulation list, and then I used to come from this process, so the code can be further optimized.