搜索资源列表
11LinkList
- 链表的源代码，分为带头节点的链表，不带头节点的链表。-Chain source code into the lead in the linked list node, the node does not take the lead List.
huffmancode1
- 霍夫曼编码。在c++ 控制台的程序，利用node的结构
Ployn-dos
- 实现多项式加法，Pa=Pa+Pb,利用两个多项式的节点构成“和多项式”-polynomial Ghaffar, Pa Pa = Pb, using two polynomials node "and polynomial"
AVLTreeVc7
- 构建一个avl树的程序，压缩包中含有项目文件，头文件和源文件。编译运行后输入结点的值如55，程序就会自动按avl规则建或重构AVL树，并以中序遍历打印出来，以100.001结束结点值的输入退出循环终止程序-AVL tree procedures, compressed packets containing project documents, files and source documents. After running compile input node as the value of
DoubleList.rar
- 用类定义一个双向链表，并定义双向链表的排序插入，删除和输出操作的成员函数，可以实现依据姓名查找结点及修改结点数据的功能，把记录以通讯录形式保存在磁盘上。,Class definition with a two-way linked list, and define the order of two-way linked list insert, delete, and member functions of the output operation can be achieved based o
delete-the-same-elemt
- 用数据结构实现顺序表删除相同节点的操作，操作比较完善-With the data structure in order to achieve the operating table to delete the same node
deleteminelem
- 删除最小节点，相同的最小节点也能删除，在C++中用数据结构进行实现-Remove the smallest node, the same minimum node can also delete the C++ data structures used to achieve
doubleList
- 使用C++做的双链表模板类 具有头插法，尾插法，左向插入，右向插入，删除结点，获取结点值，设置结点值，复制构造函数，还重载了输出操作符、赋值操作符、相等操作符和不等操作符，还具有倒置链表的功能。还有结点类的重载的输出操作符，具有很好的封装性。-Using C++ to do the double linked list template class with the first interpolation method, tail interpolation, left to insert th
LinkList
- 用C++的模板类实现了链表数据结构，里面包括了节点的删除、新增等简单算法-C++ template class, a linked list data structure, which includes the node to delete, add simple algorithm
Complete_binary_tree
- 在完全二叉树中，在层次遍历和先根序遍历中，已知某节点在一种遍历中的编号，求该节点在另一种遍历中的编号.-Complete binary tree in level order traversal and first traversal of the root, known to a certain node in a traversal of the code, and the node in a traversal of the code.
HQueue
- 带头结点的队列模拟程序 在控制台环境下运行 适合于初学者-Take the lead node queue simulation program running in the console environment, suitable for beginners
BST
- A Complete Binary Search Tree Program including insertion, deletion at root, leave or any node.
bintree
- 对一个二叉树进行各种运算，包括获取节点的子树节点数，节点层数，节点子树的最大值等等。-Various operations on a binary tree, including access to the sub-tree nodes in the node, the node number of layers, so the maximum value of the node subtree.
heapsort
- 堆排序(HeapSort)是一树形选择排序。堆排序的特点是：在排序过程中，将R[l..n]看成是一棵完全二叉树的顺序存储结构，利用完全二叉树中双亲结点和孩子结点之间的内在关系(参见二叉树的顺序存储结构)，在当前无序区中选择关键字最大(或最小)的记录-Heap Sort (HeapSort) is a tree selection sort. Heap sort is characterized by: the sort process, the R [l.. N] as a complete b
rebblacktree
- 红黑树的实现，如何增加删除节点等，以及代码测试。-Red-black tree implementation, how to increase the delete node, as well as code testing.
test1
- list对任意位置的元素进行插入，删除，查找都是极快速的，list的每个节点都有三个域：前驱元素指针域，数据域，后驱元素指针域-List any position of the elements to insert, and delete, find it is extremely fast, the list each node has three domain: precursor element pointer domain, data fields, the rear element p
Two_forks_the_tree
- 定义一个本地C++类来表示整数值的有序二叉树。还需要一个Node类，不过它可以使BinaryTree的内部类。写程序，通过存储任意顺序的整数，然后以升序方式检索并输出这些整数，测试BinaryTree类是否工作正常。-Define a the local C++ class to represent the integer value of the ordered binary tree. A Node class, but it can make a BinaryTree the intern
ASSIG4
- this the program for the linked list in which we have to add the node from the first and delete the node from last.-this is the program for the linked list in which we have to add the node from the first and delete the node from last.
erchashu
- 设计程序实现二叉树结点的类型定义和对二叉树的基本操作。该程序包括二叉树结构类型以及每一种操作的具体的函数定义和主函数-Design procedures to achieve binary tree node type definitions and basic operation of the binary tree. The program includes a binary tree structure type, as well as each operation of the spec
xianxingbiao
- 1、 创建线性表类。线性表的存储结构使用链表。 2、 完成表首插入元素、删除指定元素、搜索表中是否有指定元素、输出链表。 3、 输入n个不为零的整数作为节点元素值，遇到0代表输入结束（不创建元素值为0的节点），创建链表。输出整个链表。 4、 输入一个整数，将该数作为一个元素值插入表首位置。输出整个链表。 5、 输入一个整数，在链表中进行搜索，输出其在链表中的位置。如果不存在输出0。 6、 再一次输入一个整数，在链表中进行搜索，输出其在链表中的位置。如果不存在输出0。 7、