搜索资源列表
C01
- 学生课程成绩管理系统，C语言课程设计的一类，这个系统适用的是文本界面和三级链表，可以实现维护（增删改）、查询（精确查询和模糊查询）、统计等功能，具有很强的借鉴性。-Student course performance management system, C language curriculum design for a class, the system is applicable text interface and three lists, you can achieve the mai
Project6
- 使用散列表设计实现一个字典，假设关键字为整数且 D 为 961，在字典 中插入随机产生的 500 个不同的整数， 实现字典的建立和搜索操作。分别使 用线性开型寻址和链表散列解决溢出。-Designed and implemented using a hash table dictionary, if your keywords is an integer and D 961, in the dictionary 500 different integers inserted rand
binary-tree
- 1.实现二叉树的下列运算: [1]输入一个二叉树的先序序列，生成二叉树的二叉链表 [2]显示其先序、中序和后序遍历结果。 [3]计算二叉树的叶子结点数。 [4]求二叉树的深度 2.编程实现二叉树的层次遍历 3.哈夫曼编码-1.operational binary tree: [1] Enter a first sequence binary tree sequence, generating a binary tree binary list [2] show
Link_List
- Visual C++实现的链表，队列，和栈的代码-Visual C++,LinkList,Stack,Queue code
Eightdigital
- 八数码问题,利用链表，实现对Open和Close链表的结点扩展，遍历并检测是否符合！- Eight digital, use the list to realize the junction Open and Close list expansion, and detects whether the traverse!
BigNumAlgorithm
- C++实现大位数加减乘除，使用链表等技巧，值得研究其实现方式-C++ add minus multi div
Polynomial
- 通过链表的方式，实现了两种不同方式下的多项式相加-Through the list of ways to achieve a polynomial in two different ways under the sum
SingleList
- C++封装了单链表数据结构，实现了前插，后插及任意位置插入元素，排序、删除相同元素、清空链表、链表融合等函数。-C++ encapsulation of a single linked list data structure to achieve forward runs, and after insertion to any position of the insertion element, sort, delete the same element, empty the list, the
DoubleList
- C++语言封装了循环双向链表数据结构，实现了任意位置插入、节点个数获取、删除元素、查找元素等函数功能。-C++ language package circular doubly linked list data structure to achieve an arbitrary position of the insertion, the number of nodes get, delete elements, find elements etc. Function.
Binary-Tree
- （1）从键盘上输入数据，建立二叉链表。 （2）前序遍历、中序遍历、后序遍历二叉树：递归算法。 （3）前序遍历、中序遍历、后序遍历二叉树：非递归算法。 （4）借助队列实现二叉树的层次遍历。 在主函数中设计一个简单的菜单，分别调试上述算法。-(1) input data the keyboard, build binary list. (2) former preorder, preorder, after preorder binary tree: recursive al
20160526stackaqueue
- 利用C++实现了数据结构中类和栈的主要功能，主要以线性链表的形式实现。-The use of C++ implementation of data structures class and stack the main function, mainly in the form of a linear linked list implementation.
ConsoleApplication4
- 集合的交并补差运算，对称差，采用链表的方式对集合进行存储，可以实现集合的检查排序和运算，模块间耦合度低，可移植性好。-Collection of occurring simultaneously senders operation, symmetry is poor, with the method of linked list to storage of collection, can realize check sorting collection and calculation, the
MultifunctionalCalculator
- 基于MFC平台，实现多功能计算器，可求解复杂表达式，主要实现为数据结构中链表和数组，对于要熟悉链表和数组的初学者有很帮助。-Based on the MFC platform, to achieve multi-function calculator, can solve complex expressions, the main realization of the data structure for the list and array, to be familiar with the l
List-of-the-basic-operation
- 链表的基本操作（函数已封装） 交并差的实现- List of the basic operation (function has been encapsulated) Realization of Crossing and
2
- 使用c plus plus高效实现双向链表，有效实现便利和查找-Use c plus plus efficient implementation of two-way linked list, the effective realization of convenience and search
sjjg
- 完成一个带头结点的单链表建立，实现初始化、求表长、取元素、按值查找、单链表的插入、删除、遍历访问等基本操作。 在此基础上，利用原链表结点空间实现逆转并输出结果。-Complete a lead list of single-linked list of the establishment, to achieve initialization, the length of the table, take the elements, according to the value of singl
DoubleLinkList
- 编程实现双链表存储结构及其基本运算的设计方法，主要包括以下功能： 初始化双链表H（H为单链表头指针） 依次采用尾插法插入’a’,’b’,’c’,’d’,’e’五个字符元素 输出双链表H 输出双链表H的长度 判断双链表H是否为空 输出双链表H的第三个元素 输出双链表H中字符元素’d’的位置 在第四个元素位置上插入字符元素’f
2
- 用链表的方式实现多项式的加减，其中结构体包含幂次和系数。-Polynomial addition and subtraction with a list of ways in which the structure and contains the power of coefficients.
Data-structure-experiment
- 数据结构实验源码如一元稀疏计算器，链表线性表等，纯手打，亲测可跑。注释中有对应实现的功能。-Data structure of the experimental source code such as a sparse calculator, linear list, etc., pure hand, pro test run. Note the corresponding implementation of the function.
5107600数据结构配套光盘
- 实现对任意给定的二叉树（顶点数自定）建立它的二叉链表存贮结构，并利用栈的五种基本运算（置空栈、进栈、出栈、取栈顶元素、判栈空）实现二叉树的先序、中序、后序三种遍历，输出三种遍历的结果。((Any given realization of the binary tree (self-Vertices) the establishment of its chain store binary structure, and use the five basic computing stack (The