搜索资源列表
Bin盲rer_Suchbaum
- representation of a binary search tr-representation of a binary search tree
optimalBinarySearchTree
- 最佳二元收尋樹 自己寫的作業 給剛入門的學生 參考用-The best binary search tree written in their own operations just give students entry-reference
Search
- 文档包含两个程序，第一个实现了希尔排序、快速排序、堆排序、折半查找。第二个实现了二叉树查找。均包含源码和一组测试结果。-Document contains two procedures, the first implementation of the Hill sort, quick sort, heap sort, binary search. The second implementation of the binary tree search. Contains the source co
datasturct2
- 包含选择排序法，插入排序法，二叉树排序法，以及冒泡排序法。-this pakcet includes the program about Selection Sort Insertion Sort Binary Search Tree Bubble Sort
ACMsearchTREE
- ACM竞赛的一些搜索剪枝算法的应用，供大家学习-ACM search tree
suffixtree
- this is an implement of suffix tree in java which is used as search in dectionary
BinarySearchTree
- 这个文件提供的C++代码实现的二叉搜索树。这是一种高效的数据结构。非常有参考价值。-The file is about binary search tree.It is implemented with C++ language.This structur is very efficient.
binarysearchtree
- 叉查找树示例|二叉查找树,binary search tree,C语言-binary search tree
RBTreeCode
- 红黑树和二叉查找树数据结构的实现以及二者的性能比较的C语言实现代码-Red and black binary search tree and the tree data structure, as well as the achievement of the performance comparison between the C language code
search
- 以深度为k的满二叉树(n=2k-1)为例，假设表中每个记录的查找概率相等，即 pi=1/n（1≤i≤n），而树的第i层上有2i-1个结点，因此，折半查找的平均查找长度为： 所以，折半查找的平均时间复杂度为O(log2n)。 -To a depth of k over the binary tree (n = 2k-1) as an example, suppose the table to find the probability of each record the same,
csc562HW1Sol
- The search tree has a branching factor of 4. All edges have unit costs except those that go to states 5, 8 and 9 (cost 3). The node-counts given below include the start and the goal nodes (if you indicate otherwise and your answers are consistent the
btree
- 数据库的应用，基于索引，实现一个简单的B+树搜索树 -Database application, based on the index, the realization of a simple B+ tree search tree
AVLTree
- 用C实现的AVL搜索树的完整源码，包括插入操作和删除操作的具体实现，以及平衡的调整-AVL with C achieved a complete search tree source code, including the insertion operation and deletion of concrete realization, as well as the adjustment of balance
ex2list
- 二元樹搜尋 利用物件導向的技術建立二元搜尋樹 包含了所有用物件導向寫的程序-Binary tree search using object-oriented technology to build a binary search tree that contains all written using object-oriented program
BST
- This is an implementation of the Binary Search Tree algorithm.
binstree
- To learn the representation and implementation of a binary search tree.
OptimalBST
- 用C++构造的最优二分检索树,是学习算法的很好参考-This programe construct a Optical Binary Search Tree. It is the good reference to learn Anrithlog.
Bintree
- 建立二叉树，搜索二叉树等，实现了二叉树的常用功能-The establishment of tree, search tree and so on, to achieve a common feature tree
bstcnt(1)
- 二叉搜索树(Binary Search Tree)是满足如下性质的二叉树： ①若它的左子树非空，则左子树上所有结点的值均小于根结点的值； ②若它的右子树非空，则右子树上所有结点的值均大于根结点的值； ③左、右子树本身又各是一棵二叉搜索树。-Binary Search Tree (Binary Search Tree) is to meet the nature of the binary tree as follows: ① If its non-empty left subtree
BSTREE
- Binary Search Tree Implementation with extra features like Maximum Depth of a tree, Minimum element in the BST and Mirroring of BST.