搜索资源列表
magicCube2x2x2
- using search tree solve magice cube
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.
ThreadedBinarySearchTree
- 用C#实现中序线索二叉树的插入、遍历、删除等操作-Threaded Binary Search Tree (C#)
BinarySearchTree
- 一个简单的二叉搜索树实现,可以直接使用头文件移植-A simple binary search tree implementation can use the header files transplant
LAB
- 使用C++的STL数据结构实验,包括链表、八皇后、扩展洗车仿真、Binary Search Tree的平均树高等问题的实验-Using C++, STL data structure experiments, including lists, eight queens, extended car wash simulation, Binary Search Tree problems as the average tree experiment
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
ass3
- 数据结构作业源代码,实现二叉查找树的一些基本功能。-Operation data structure source code, binary search tree to achieve some of the basic functions.
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
ArboreDeCautare
- Search tree java , modal search box
ktree-1
- Min k tree in tabu search
ccc
- 在二叉搜索树上删除一个有两个子女的结点时,可以采用以下三种方法: (1) 用左子树TL上具有最大关键码的结点X顶替,再递归地删除X。 (2) 交替地用左子树TL上具有最大关键码的结点和右子树TR上具有最小关键码的结点顶替,再递归地删除适当的结点。 (3) 用左子树TL上具有最大关键码的结点或者用右子树TR上具有最小关键码的结点顶替,再递归地删除适当的结点。可随机选择其中一个方案。 试编写程序实现这三个删除方法,并用实例说明哪一个方法最易于达到平衡化。 -In the bin
shuju
- 书中使用主流的程序设计语言C++作为具体的实现语言。 书的内容包括表、栈、队列、树、散列表、优先队列、排序、不相交集算法、图论算法、算法分析 、算法设计、摊还分析、查找树算法、k-d树和配对堆等。 -Book using mainstream programming language C++ as a specific implementation language. The book includes tables, stacks, queues, trees, hash tables
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_trees
- 二叉树以及二叉查找树的定义及实现,插入、删除、先序、后序、中序、层序-binary tree and search tree
heibaiqi.c
- 用C实现的黑白棋源程序,有人工智能的人机对战,用算法树深度搜索,原始的C图形界面,turboC或TC编译器运行。网络上实现黑白棋大多选择VC++,并没有用C实现并且有人工智能的程序。-Implementation of Othello with C source code, there is artificial intelligence, human-machine gaming, with the depth of search tree algorithm, the original C-
BST
- Binary search Tree implementation.