资源列表
Apostolico-Crochemore
- Java Dizgi Eş leme Algoritmaları Apostolico-Crochemore algoritması
java
- JAVA经典教程，初学者的福利，赶快下载吧！-JAVA classic tutorial, beginners welfare, to download it!
CopyContainsRandomPartList
- 复制具有随机域节点的链表， 导入eclipse时要改包名package classOne -Copy Contains Random Part List
BuildQueueByTwoStacks
- 通过2个队列来模拟栈， 运行导入eclipse时要改包名package classOne -Build Queue By Two Stacks， change package name,
BSTToDoubleLinkedList
- 二叉搜索树 转为 双向链表， 导入eclipse时要改包名package classOne -BST To Double LinkedList change package name,
ReverseLinkedListEveryKNodes
- 链表中每K个节点 逆置。..导入eclipse时要改包名package classOne -Reverse LinkedList Every K Nodes change package name,
bracket_matching
- 括号匹配是栈的一种经典应用。本功能主要是实现输入一串字符（里面包括左括号右括号等），判断你的括号是否有相应的匹配值。如果没有则返回错误并退出程序。-bracket matching program is the typical application of stack. the program of it is to check whether the sequence have been right in the aspect of bracket.
sort_leap
- 堆排序是一种比较优化的排序方法，特备是在只是找一串数字中前几个最大最小值时更显示它的优势。这个程序的堆排序包括每一轮的堆排序的调整以及最终的排序结果的显示。-leap sorted method is a excellent way to handle the sequence , exspecially when you want to find the proitory max or min number .the program concludes the method of the ad
BFS_graph
- 这是数据结构中图的广度优先算法的实现。广度优先算法是按照每个节点的拥有的孩子数目来进行遍历的。而不像图的深度优先算法是按照深层次，然后如果不能继续进入更深一层，就往回遍历。-BFS program of tree have a large of difference of the DFS program of trees.The produre of it is with the method of the children of a point ,rather than the depth o
graph_dfs
- 图的深度优先遍历算法程序。代码已经将图的深度以及每一层的节点写固定了。可以自己进去修改。-the program is the dfs of tree.the point of the tree and the layer of it has been fix.you can change it as you want.
05_RBT
- 红黑树的创建插入与删除的具体源代码的实现-Achieve red-black tree create insertion and deletion of specific implementation code
2chashu_bianli
- 该功能主要用vc++实现。实现二叉树的遍历算法。遍历的方法是先序遍历。-the funcontioin of the program is find a point in the tree in the struture of data .and then the method of it is LF.