在视图里实现链表，并把当前链表节点设为红色。-Achieve in the list view and list the current node is set to red.

区间树上的重叠区间查找算法:通过增加树结点的信息域将红黑树扩张为区间树，并通过给定的某个区间i，查找区间树上相应的重叠区间。-The overlap interval between the tree search algorithm: tree node by increasing the information domain will be red and black tree expansion for the interval tree, and through a given inte

在C语言环境下，实现对红黑树的插入结点操作。-In the C language environment, achieving the insertion of the red-black tree node operation.

红黑树的算法模拟。红黑树的生成，结点的插入、删除和调整。通过类的方式管理。-Red-black tree algorithm simulation. The formation of red-black tree, node insertion, deletion, and adjustment. Administered by the class.