Work3.5

讲解了循环单链表的建立，以及在链表中插入、删除、更改数据...(Explain the establishment of circular single linked list, and insert in the list, delete, change the data ...)

Monkeys and peach,Monkeys and peach(Monkeys and peach)

使用C++/C语言实现的红黑树，对于数据结构的学习有所帮助。(Use red-black tree C++/C language for learning data structures helpful.)

说明：  有助于c++的初学者在平日的学习中更好的学习(Contribute to better learning c++ beginners learning on weekdays)

说明：   简单的链表实现 链表可以初步了解(A simple list can be linked to achieve a preliminary understanding)

链栈 对于堆栈stack的链式实现 应用指针(linked stack)

该代码实现了深拷贝的问题，对于深拷贝进行了一系列的介绍，并且显示其与浅拷贝的区别。(A deep copy of the code issues a series of deep copy for presentation, and shows the difference between a shallow copy.)

长整数四则运算,利用双向循环链表实现长整数的存储，每个结点含一个整形变量。 (Long integer arithmetic, the use of two-way circular linked list to achieve long integer storage, each node contains an integer variable.)

说明：  二叉树的演示程序。实现了二叉树和哈弗曼树(Binary tree demo program. Implements a binary tree and the tree Hafu Man)

根据所选定的字符顺序，按照从大到小的规则，对字符进行插入排序，(Insert and sort characters)