搜索资源列表
ch07_Search
- 搜索结构，包括静态搜索结构、二叉搜索树、AVL最优树-ch07_Search.rar
searchBST
- 二叉搜索树实现的文本文件单词索引表，可将文本中单词按字母顺序列出并且列出每个单词在文本中出现的次数-Binary search tree implementation of the text file the word index table, you can text the word list in alphabetical order and each word in the text are listed in the number of occurrences
AVLTree
- 平衡二叉树。高效的搜索算法。生成深度最小的二叉搜索树。在大量数据中最快实现搜索。-Balanced binary tree. Efficient search algorithm. Generated the smallest depth binary search tree. Large amounts of data to achieve the fastest in the search.
BinarySearchTree
- 一个简单的二叉搜索树实现,可以直接使用头文件移植-A simple binary search tree implementation can use the header files transplant
AVLtree
- 二叉搜索树的avl树问题，创建avl树及有关的问题-Binary search tree avl tree problem, create avl trees and related problems
Binarysearch
- 二叉搜索树的初建及有关问题binary search tree -Binary search tree and the problem was first built binary search tree
Translationcircuitconnectionproblems
- 二叉搜索树中的电路连线问题 Binary search tree -Binary search tree in the circuit connection problems Binary search tree
Translationpackingproblem
- 二叉搜索树中的装箱问题Binary search tr-Binary search tree packing problem Binary search tree
src
- 对易阵游戏中两子交换的问题进行说明。讨论用回溯法搜索相邻两子交换的算法，进而研究任意两子交换的算法，重点研究搜索树的结构，并用类Java语言分别对其实现的最优算法进行描述。-On the trade front in the game two sons, the issue of exchange instructions. Discussions with the backtracking search algorithm two adjacent sub-exchange, and then
class_presentation_Btree
- 是一种多路搜索树（并不是二叉的）： 1.定义任意非叶子结点最多只有M个儿子；且M>2； 2.根结点的儿子数为[2, M]； 3.除根结点以外的非叶子结点的儿子数为[M/2, M]； -Is a multi-way search tree (not binary in): 1. The definition of any non-leaf node at most M son and M> 2 2. The son of the root n
binary_tree
- 根据Kurse版数据结构书改成的电子版课件。此章包括二叉树的概念，结构，遍历，线索二叉树，二叉搜索树，平衡二叉树，splay树-According to the data structure Kurse version of the book into electronic version of the courseware. This chapter includes the concept of binary tree structure, traversal, threaded binar
BiTreeApp
- 原创：C#实现数据结构的测试最小堆、测试二叉搜索树、测试Huffman编码-C# BiTreeApp MinHeap BinSearchTree HuffmanTree
rbtree
- 实现红黑树的相关算法，红黑树、二叉搜索树的实现和性能比较-Red-black tree, binary search tree implementation and performance comparison
tree
- 二叉搜索树，数据结构中必会知识点，经常出作业-Binary search tree data structure must be knowledge points, often out of work. .
BST
- 二叉搜索树的一个典型事例，能够处理很多二叉排序树的问题-Binary search tree, a typical example, can handle many issues Binary Sort Tree
BinarySearchTree
- 二叉搜索树，二叉搜索树的查找过程和次优二叉树类似，通常采取二叉链表作为二叉搜索树的存储结构。中序遍历二叉搜索树可得到一个关键字的有序序列，一个无序序列可以通过构造一棵二叉搜索树变成一个有序序列，构造树的过程即为对无序序列进行排序的过程。每次插入的新的结点都是二叉搜索树上新的叶子结点，在进行插入操作时，不必移动其它结点，只需改动某个结点的指针，由空变为非空即可。搜索,插入,删除的复杂度等于树高。-Binary search tree, binary search tree to find a si
check_tree_is_balance
- 检查树是否是平衡搜索树，，，很简单清晰，，希望能帮助你-Check whether the tree is a balanced search tree, very simple and clear, I hope you can help
Binarysearchtrees
- 二叉搜索树操作 学习数据结构很好的例子 有很全的注释-Binary search tree data structure operation good example to learn a very full notes
Phoneboook
- 在很多实际应用中，动态索引结构在文件创建或初始装入记录时生成，在系统运行过程中插入或删除记录时，为了保持较好的检索性能，索引结构本身将随之发生改变。本程序采用二叉搜索树结构，设计并实现一个手机电话薄软件。-In many practical applications, the dynamic index structure in the file record created or generated when the initial load, the system is running w
sRtree
- 快速动态优先搜索树的实现Rapid implementation of dynamic priority search tr-Rapid implementation of dynamic priority search tree