搜索资源列表
ass6.........mars
- binary search tree /*class TreeNode { public: TreeNode(char m[80],TreeNode*left, TreeNode *right) void Inorder(void) char data[80] TreeNode *left_ptr TreeNode *right_ptr }
小游戏：五子棋的设计与实现
- 五子棋的设计与实现 本“五子棋“程序只编写了人机对弈部分，运用了博弈树进行搜索，在选取最优的走步时使用极大极小分析法，考虑到搜索的时间复杂度和空间复杂度，在程序中只进行了2步搜索，即计算机在考虑下一步的走法时，只对玩家进行一步的推测。（程序中的棋盘规格为15*15）。-renju the design and implementation of the "331" procedure prepared by the Human-Computer Chess, a game u
最优二叉搜索树
- 算法设计的动态规划中的最优二叉搜索树问题，是用VC＋＋编写的-algorithm design of dynamic optimal planning of two forks search tree problem by using VC + + prepared
程序员之家 - 用VisualC++6_0递归查找目录树 论文
- 用递归查找目录树 这个小程序本人认为还不错 大家共享一下吧 有用的到的 尽量下吧 -using recursive search tree this small program, I think it is good share my views useful to the next as it
binSearch
- 数据结构二叉 搜索树的实现很好的例子！-data structures: a good example of binary search tree implementation
datast
- array.h： 安全数组 linkedlist.h： 普通表 dclinkedlist： 双向循环链表 hashtable.h： 哈希表 binstree.h： 二叉搜索树 avltree.h： AVL 树 如果要存储集合（元素不可重复）并快速查找，最佳的是 binstree.h（二叉搜索树）。 如果要存储二维或更高维的表格，最佳的是 hashtable.h（哈系表）。AVL 树的插入成本非常高（删除函数也没有实现），但 AVL 的搜索效率极高，所以适用于在程序开始前初始化程-NOTE:
sift_robhess.rar
- Rob Hess Linux下的SIFT提取源码，金字塔采样和高斯差分提取特征点，KD树搜索寻找同名点，RANSAC去粗差,Rob Hess Linux source code under the SIFT extraction, sampling and Gaussian pyramid differential extraction of feature points, KD tree search to find the same name, points, RANSAC to gross
RTreeTemplate.zip
- R树，具有搜索，添加，删除节点能，利用R树，可以为空间搜索速度带来很大的提升，是GIS中必备的一种算法,R tree, with the search, add, delete nodes can use R trees, you can search for the space a great deal of speed upgrade is necessary for GIS in an algorithm
二叉查找树的创建、查找、插入和删除
- 二叉查找树的创建、查找、插入和删除 问题描述：运行时产生若干个随机整数，依次插入到一棵初始为空的二叉查找树中，并能在其中查找、插入、删除指定的整数。,Binary Search Tree to create, find, insert and delete the problem descr iption: run-time generated a number of random integers, followed by insertion into an initial empty bi
binary_tree.rar
- 根据所输入的一串数字，以“，”间隔，生成一棵二分查找树，生成的树以图像形式出现。,According to the input of a string of figures, interval to generate a binary search tree, the tree generated in the form of images.
RBT.rar
- 运用C++进行红黑树的描述，对红黑树的插入、删除、查找等操作进行了实现等等。,The use of C++ for a descr iption of red and black tree on the red and black tree insert, delete, search and other operations to achieve and so on.
chess_horse
- 程序实现象棋马，搜索有多少种走法，用搜索树。-Chess horses, many types of moves the search with the search tree.
greedy_OBST
- 贪心算法实现的最优二叉查找树，c++代码实现，运行无误-Greedy algorithm of optimal binary search tree, c++ code to run correctly
main
- AVL树中 插入、删除节点以及判断一棵二叉查找树是否为AVL树-AVL tree, insert, delete nodes and a binary search tree to determine whether the AVL tree
RBTreeAndBinary_Search_Tree
- 实现红黑树、二叉搜索树相关算法：插入（红黑树涉及树的调整：左旋、右旋等），删除，搜索（指定Key值节点）。 另外，红黑树实现计算树黑高的算法。 -To achieve red-black tree, binary search tree related algorithms: insertion (red-black tree involves the adjustment of the tree: L, D, etc.), delete, search (Key value of t
bPlusTree
- B+树，用JAVA语句实现了一个B+树，包括B+树的构成，B+树的增删查改-B+ tree, using JAVA statement to achieve a B+ tree, including the composition of B+ tree, B+ tree of additions and deletions to change search
totalarrange-recursion-backtracking
- 在排列树上递归回溯搜索全排列问题的全部解-Recursive backtracking search tree in the arrangement of the whole array of all solutions of the problem
kdtree
- K-D树源码，不错的空间查找算法，在三维重建和匹配中应用较多！-KD tree source, good space search algorithm, in the three-dimensional reconstruction and matching the application of more!
KD_Tree
- KD_Tree In computer science, a kd-tree (short for k-dimensional tree) is a space-partitioning data structure for organizing points in a k-dimensional space. kd-trees are a useful data structure for several applications, such as searches involving a m
TireTree
- Trie树,又称字典树、单词查找树,是一种树形结构，用于保存大量的字符串。它的优点是：利用字符串的公共前缀来节约存储空间，是一种比较简单的数据结构。理解起来比较简单,但Trie树也有它的缺点,Trie树的内存消耗非常大。-Trie tree, also known as a dictionary tree, word search tree is a tree structure used to save a lot of strings. Its advantages are: the use