搜索资源列表
Btree
- 二叉排序树又叫二叉查找树，它是一种特殊的二叉树，本程序在VC环境下运行过，简单实用-Binary sort tree is also called the binary search tree, it is a special kind of binary tree, the program is running in the VC environment, the simple and practical
RFID
- 一种改进的RFID二进制搜索防碰撞算法，基于二进制树的防碰撞算法研究-An improved anti-collision RFID binary search algorithm, binary tree-based anti-collision algorithm
na3
- 实现二叉排序树的插入，生成二叉排序树，二叉排序树的查找，二叉排序树的删除，先序遍历输出二叉树-To achieve binary tree insertion sort, binary sort tree generation, binary search tree sort, binary sort tree to remove the first order binary tree traversal output
kd_tree
- 一个高效的k-d tree实现，可以广泛的应用与图形图像处理。-K nearest neighbor search based on KD-tree
dtcwpt
- 2-band discrete wavelet transform (DWT) Dual-Tree Complex Wavelet Packet-The 2-band discrete wavelet transform (DWT) provides an octave-band analysis in the frequency domain, but this might not be ‘optimal’ for a given signal. The discrete wave
search
- 树的遍历（非递归方式实现）：首先按中序方式建立树并输入节点信息，通过栈实现树的非递归方式的先序、中序和后序的遍历-Tree traversal (non-recursive way): First of all, by the way in order to establish the tree and enter the node information, the realization of the tree through the stack of the first non-recurs
tree
- 所谓遍历(Traversal)是指沿着某条搜索路线，依次对树中每个结点均做一次且仅做一次访问。访问结点所做的操作依赖于具体的应用问 题。 -The so-called ergodic (Traversal) refers to a search along the line, followed on each node in the tree are done once and only one visit. Access node operation done depends on the
Chapter11Trees
- binary tree and binary search tree algorithm
BTree
- Source code and example of Binary Search Tr-Source code and example of Binary Search Tree
Project
- GUI based binary search tree search engine from text files or folder
apriori
- A program to find association rules and frequent item sets (also closed and maximal) with the apriori algorithm (Agrawal et al. 1993), which carries out a breadth first search on the subset lattice and determines the support of itemsets by subset tes
ab-tree
- (a,b) tree with finger search
binarytree
- Up to this point, we have assumed that an optimal search tree is one in which the probability of occurrence of all keys is equal (or is unknown, in which case we assume it to be equal). Thus we concentrated on balancing the tree so as to make the
TASKS
- 限界剪枝法语回溯法类似，是一种在问题的状态空间树中搜索解的算法。优先级用优先队列来实现，优先级高即估计函数值越低的结点越靠近队列开头位置。-French back-Bound pruning method similar to the problem is a state-space search tree algorithm solution. Priority queue with priority to the realization of the high priority that i
BST
- binary search tree in c
8box
- Artificial Intelligent (AI) helper tool, visually build the search algorithm tree.
DataStructureAlgorithm
- 数据结构和算法，非常经典，讲的很详细！第一部分 基础知识 第一章 C++程序设计 第二章 程序性能 第二部分 数据结构 第三章 数据描述 第四章 数组和矩阵 第五章 堆栈 第六章 队列 第七章 跳表和散列 第八章 二叉树和其他树 第九章 优先队列 第十章 竞赛树 第十一章 搜索树 第十二章 图 第三部分 算法设计方法 第十三章 贪婪算法 第十四章 分而治之算法 第十五章 动态规划 第十六章 回
StaticSearchTable
- 一个实现了三个查找功能的c语言源代码，分别是顺序查找，折半查找和二叉查找树上的查找。可用VC直接编译运行，对查找算法做了很好的演示。-A search function to achieve the three c-language source code, namely, sequential search, binary search and binary search tree to find. VC can be compiled to run directly on the searc
project1(program)
- 二叉树搜索树的比较课程作业对数据结构会有更好的认识-Comparison of binary search tree data structures will be course work for a better understanding of
BSTapp
- This is Binary Search tr-This is Binary Search tree