资源列表
maandian
- 找马鞍点：1. 若在矩阵Am×n中存在一个元素A[i][j]，其满足A[i][j]是第i行元素中最小值，且又是第j列元素中最大值，则称此元素为该矩阵的一个马鞍点。用二维数组存储矩阵Am×n ，设计算法求出矩阵中所有马鞍点。-Find a saddle point: 1. If in the matrix Am × n, there is a element of A [i] [j], the meet A [i] [j] is the first line element in the mini
jiaohuanzuoyouzishu
- 已知二叉树采用二叉链表存储结构，编写一个算法交换二叉树所有左、右子树的位置，即结点的左子树变为结点的右子树，右子树变为左子树。-Known binary tree using linked list storage structure, the preparation of a binary tree algorithm for the exchange of all the left and right subtree of the location, that is, the left no
tongjierchashujiedian
- 采用二叉链表结构存储一棵二叉树，编写一个算法统计该二叉树中结点总数及叶子结点总数。-Binary list using a binary tree structure of storage, the preparation of a statistical algorithm of the binary tree nodes and the total number of the total number of leaf nodes.
xunhuanliedui
- 2． 假设以数组sequ[m]存放循环队列的元素，同时设变量rear和quelen 分别指示循环队列中队尾元素的位置和内含元素的个数。编写实现该循环队列的入队和出队操作的算法。提示：队空的条件：sq->quelen==0；队满的条件：sq->quelen==m。-2. Assuming an array sequ [m] cycle queue storage elements, while the variable set, respectively, rear and instr
Exercise1
- 薛超英所教的数据结构课的实习一答案，供大家参考-薛超英data structure of a training course the answer
Exercise2
- 薛超英老师的数据结构课的实习二作业答案，供大家参考-Data structure薛超英teacher training course the answer to the second operation, for your information
Exercise3
- 薛超英老师的数据结构课的实习三的答案，仅供参考-Data structure薛超英teacher training course three answers are for reference only
Exercise4
- 薛超英老师的数据结构课的实习四答案，仅供参考-Data structure薛超英teacher training course four answers are for reference only
ds1
- 东北大学计算机单独考试数据结构重要资料，2009年最新-ds
datastructure
- 数据结构的高一凡代码，数据结构书上的代码全部有-A data structure where the high-code, data structures books, all of the code
create_algraphic
- 图的建立，里面包括有向图和无向图的建立，还有带权值的建立方法，也有图的输出算法，图的存储结构是以邻接链表的形式存储的。-The establishment of plans, which include the maps and the establishment of undirected graph, as well as with the establishment of methods of weight, but also the output graph algorithms, ma
create_graphic
- 图的建立，有多种的图可以选择，也可以选择图的遍历方法，里面的图的存储结构是以顶点数组和邻接矩阵的方式存储的。-Map-building, there are several plans to choose, you can choose to graph traversal method, which the storage structure of the plan is based on vertex adjacency matrix of the array and stored the.