资源列表
多项式运算
- 多项式运算： 本程序可以实现多项式四则运算，文件夹里含源cpp文件和exe可执行文件。 经过作者多次质量检测，程序运行质量合格，满足基本的设计要求。 本程序仍存在许多可以改进和优化之处，望您加以个性化的美化！感谢您！(Polynomial operation: Can achieve polynomial four operations, folder containing source cpp file and exe executable file. Through the aut
07 - Linked Lists
- As we saw in the previous unit, one way to implement the list ADT was with an array. An alternate approach is what's called a linked list, a.k.a. a pointer-based list
10 - Stacks
- the ADT we have come up with is a well known ADT called a stack, which is defined by our four operations
20163311_李颖__16计科2班_数据结构与算法实验2
- 数据结构链表的8个实验，约瑟夫环，一元稀疏多项式计算器，将元素X插入到链表中的适当位置，删除链表中所有大于mink且小于maxk的元素，就地逆置，删除线性表A中同时出现在表B和表C中的结点，构造三个循环链表，长整数的四则运算(8 experiments, data structure of Joseph ring, one dollar sparse polynomial calculator, the X element into the appropriate location in the
Huffman
- 实现哈夫曼编码,C语言实现，单文件直接编译运行。注册开通用，垃圾作品，课程作业(huffman coding The realization of Huffman encoding, C language, single file directly compile and run. Registered with the opening, trash, course work)
newOne
- 数据结构的p267-10,p272-1,p278-4,p287-2,p296-1,p301-4,p323-5可能有用的一个解法(DataStructure Page 267 subject 6)
StudentList
- 基于VS的一个简单的单向链表算法，可以添加、删除节点(A simple linked list algorithm based on Visual Studio)
josephus
- 通过c语言数组算法解决josephus问题，m个人围成一圈，从第一个小孩开始顺时针方向每数到第n个小孩时这个小孩离开，最后剩下的小孩是胜利者。求第几个小孩为胜利者(C language array algorithm to solve the Josephus problem, m individual circle, from the first child began to count clockwise every n children, the child left, and final
linkQueue
- doc版本的链表模版 可以用来进行数据结构编程(doc version of linked list template)
0000
- 编写一个程序读入一个字符串，统计该字符串中出现的字符及其次数，然后输出结果。要求用一个二叉树来保存处理结果，字符串中的每个不同的字符用树描述，每个结点包含4个域()
algorithm
- 实现常用算法，有常用的栈、队列、各种树操作等等(Implementation of common algorithms)
二叉树遍历
- 实现二叉树的前序，后序遍历 实现树的前序，后序遍历(The realization of the two fork tree, after the traversal Preorder tree traversal implementation.)