资源列表
tree
- 采用树的左右孩子存贮结构，实现树的先序、中序、后序及层序遍历。-About children with tree storage structure, to achieve the tree first order, in order, and postorder traversal sequence.
shujujiegou
- 这里介绍了基本的数据结构资料。内容丰富且非常实用。-Here are the basic data structure information. Rich and very practical.
Cbinarysearchtreeexamplecode
- C++ 二进制查找树的实例代码-C++ binary search tree example code
date
- 数据结构与算法分析：C语言描述+中文版，这是一本写的挺好的书，写的很全面。-Data Structures and Algorithm Analysis: C language descr iption of+ Chinese version, which is written in a very good book, written in a very comprehensive.
mergelink
- 这是一个实现有序链表合并的小程序。主要是为了掌握数据结构与算法。-This is a linked list to achieve an orderly combination of small programs. Mainly in order to grasp the data structures and algorithms.
xianduanshu
- 介绍了线段树的相关知识结构。内容丰富，实用性强。-Introduced the segment tree of the knowledge structure. Rich in content and practical.
HuffmanTree
- 利用Huffman树对一段文字进行最佳前缀编码，然后再解码。-Huffman Code
huffman
- 在解某些判定问题时，利用哈夫曼树获得最佳判定算法。输入学生人数和0-59、60-69、70-79、80-89、90-100各等级分布比例，输出比较次数。-Determined in the solution of certain problems, determine the best use of the Huffman tree algorithm. Enter the number of students and 0-59,60-69,70-79,80-89,90-100 distribu
inverse
- 输入一串序列，构造一个链表，并对该链表进行逆转。-Enter a sequence, construct a list, and the reversal of the list.
DS01
- 设A与B分别为两个带有头结点的有序循环链表（所谓有序是指链接点按数据域值大小链接，本题不妨设按数据域值从小到大排列），list1和list2分别为指向两个链表的头指针。请写出将这两个链表合并为一个带头结点的有序循环链表的算法-Let A and B are two nodes with the first order circular list (the so-called point of order is the link to the link at the size of data fi
DS02
- 将两个带头结点的有序循环链表合成一个带头结点的有序循环链表。 实验内容：使用键盘输入表达式，计算表达式的值并输出；将表达式转化成后缀表达式输出，利用后缀表达式求表达式的值并输出 -The two take the lead in the ordered circular list node synthesis of a lead in the ordered circular list node. Experiment: use the keyboard to enter an expr
shujujiegou
- 数据结构书籍（c++）版本，该书是比较权威的书籍，适合初学数据结构的读者。-Data structure books (c++) version of the book is more authoritative books, the data structure suitable for beginner readers.