point

说明：  数据结构实验报告链表的操作，包括创建空链表、插入、删除节点等(Experimental Report list data structure operations, including creating an empty list, insert, delete nodes, etc.)

说明：  拓扑排序 　 对一个 有向无环图 G进行拓扑排序，是将G中所有顶点排成一个线性序列，使得图中任 意一对顶点u和v，若u，v ∈E，则u在线性序列中出现在v之前。 　 通常，这样的线性序列称为满足拓扑次序的序列，简称 拓扑序列 。 注意： 　 ①若将图中顶点按拓扑次序排成一行，则图中所有的有向边均是从左指向右的。 　 ②若图中存在有向环，则不可能使顶点满足拓扑次序。 　 ③一个DAG的拓扑序列通常表示某种方案切实可行。 (Topological sort In a directed acyclic graph G topological sort, is all vertices will G formed a linear sequence, make diagram post Meaning a pair of vertex u and v, if u, v ∈ E, then u in linear sequence in which they appear in v before. Usually, such linear sequence sequence of topological order called meet, abbreviation topology sequence. Note: (1) if the diagram according to the topology order line vertices, then figure all from left to right edge are pointing. (2) if the figure to exist in the ring, is impossible to have the vertex meet topological sequence. (3) a DAG topological sequence usually expressed some scheme is feasible. )

数据结构课程作业，查找算法。用哈希算法下实行查找(Data structure course work, search algorithm. Under the hash algorithm used to find)

最大堆排序算法，C++语言编写,原程序，算法导论(The maximum heap sort algorithm, C++ language)

单向链表的创建与操作 设单向链表中节点的数据域的数据类型为整型，编写函数实现以下操作： （1）实现单向链表的创建（包括初始化）与输出操作，节点的个数及节点的数据由用户输入。 （源代码：ds3-1.c） （2）查找给定的单链表中的第i个节点，并将其地址返回。若不存在第i个节点，则返回空地址。 （源代码：ds3-2.c） （3）查找给定的单链表中值为n的节点，并将其地址返回。若不存在值为n的节点，则返回空地址。同时，还应通过参数传回该节点的序号。 （源代码：ds3-3.c） （4）删除给定的单链表中的第i个节点，成功返回1，失败返回0。 （源代码：ds3-4.c） （5）删除给定的单链表中值为n的节点，成功返回1，失败返回0。 （源代码：ds3-5.c） （6）在给定的单链表的第i位上插入值为n的节点。 （源代码：ds3-6.c） （7）在给定单链表的值为m的节点的前面插入一个值为n的节点。 （源代码：ds3-7.c） (Creation and operation of a one-way linked list Set up a one-way linked list data type node integer data fields , write a function to achieve the following: ( 1 ) achieve the creation of a one-way linked list ( including initialization ) and output operation , the number of nodes and node data entered by the user . ( Source : ds3-1.c) ( 2 ) Find a single list given in the i-th node and returns its address . Without the presence of the i-th node , returns an empty address. ( Source : ds3-2.c) ( 3 ) Find a given node in a given value of n single list , and return address . Without the presence of the value of n nodes , returns an empty address. Meanwhile, the number should be returned by the parameters of the node . ( Source : ds3-3.c) ( 4 ) Delete the given singly linked list in the i-th node , the successful return 1, else return 0 . ( Source : ds3-4.c) ( 5 ) to delete a single node in the list is given n , the successful return 1, else return 0 . ( Source : ds3-5.c) ( 6 ) )

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

红黑树 二叉树 性能比较分析 红黑树 二叉树(Red-black tree binary tree performance analysis,)

校园导航问题，设计你的学校的平面图，至少包括10个以上的景点（场所），每两个景点间可以有不同的路，且路长也可能不同，找出从任意景点到达另一景点的最佳路径（最短路径）。 要求： （1）以图中顶点表示校园内各景点，存放景点名称、代号、简介等信息；以边表示路径，存放路径长度等有关信息。 （2）为来访客人提供图中任意景点相关信息的查询。 （3）为来访客人提供任意景点的问路查询，即查询任意两个景点之间的一条最短路径。 （4）修改景点信息。 (Campus navigation problem, the design of your school s plan, at least more than 10 attractions (places), between every two spots can have a different way, and the long road may be different, to find spots to reach from any other attractions best path (shortest path). Requirements: (1) graph vertices represent various campus sites, storage sites name, code, profile and other information the side that path, the path length of storage of information. (2) the figure for visiting any sites offering information about the query. (3) any attractions for visiting guests ask queries of that query any two of the shortest path between sites. (4) modify the attractions information.)

队列的一般数据结构 队列的创建 删除 修改 取数据等等(The general data structure queue queue to take the data and so create delete modify)

中科大数据结构全部上机实验的实验程序以及报告，内容包括多项式，图，栈，SQL语言……(All experimental procedures USTC data structures as well as reports on experiments, including polynomial, maps, stack, SQL language ......)