搜索资源列表
optimalBinarySeachTree
- Build an optimal binary search tree using dynamic programming.-Build an optimal binary search tree using d ynamic programming.
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
bianli
- 所谓遍历(Traversal)是指沿着某条搜索路线，依次对树中每个结点均做一次且仅做一次访问。访问结点所做的操作依赖于具体的应用问 题。 -The so-called ergodic (Traversal) refers to a particular search along the line, followed on the tree each node are done once and only once to visit. Access node operation done de
txt
- 用二叉链表做存储结构，输入键值序列，建立一棵二叉排序树并在二叉排序树上实现查找算法。-To do with binary storage structure list, enter the key sequence, set up a binary sort tree and binary search algorithm to sort the tree implementation.
bst
- binary search tree in c
bstree.tar
- this a binary search tree implementation including some operations. Have fun.-this is a binary search tree implementation including some operations. Have fun.
OptimalBST
- 最优二叉搜索树的构建，动态规划实现。gcc编译通过，可将构建好的树以列表的形式打印出来。-Optimal binary search tree construction, Dynamic Programming. gcc compile.
myvtree
- 此源码实现了二叉搜索树的生成及输出排序后的结果-This source code implements a binary search tree generation and output the results sorted
bfs
- Its a source code to find the breadth first search of a tree.It works both for tree as well as for forest.It has 3 files the source code bfs_forest.c , the input file bfsinput1.txt and output file.
abstract-data-types
- In this homework, we are going to implement various ADTs including “doubly linked list”, “dynamic array” and “binary search tree”. Based on the parameter to the “make” command, we will generate 3 different executables: “adtTest.dlist”, “adtTest
tree
- 创建二元二叉树，输出二叉排序树，在二叉排序树中查找相关结点，递归查找.-Create binary tree, output binary sort tree，search relevant nodes in the binary sort tree.
binary-tree
- 二叉树的创建，二叉树中结点的查找，测二叉树的深度宽度，输出二叉树的叶子结点-Binary tree creating, search binary tree node , the binary tree s depth and width, output binary tree leaf nodes
adt-tree
- 二叉排序树：又称二叉查找树。 它或者是一棵空树；或者是具有下列性质的二叉树： （1）若左子树不空，则左子树上所有结点的值均小于它的根结点的值； （2）若右子树不空，则右子树上所有结点的值均大于它的根结点的值； （3）左、右子树也分别为二叉排序树；-Binary sort tree: also known as binary search tree. Or an empty tree or a binary tree with the following properties: (1) If t
TreeToList
- 将二叉搜索树变为双向链表，先序遍历输入节点，输出双向链表-The binary search tree into a doubly linked list, doubly linked list of the preorder traversal of the input node, output
Tree
- 数据结构中树的一些算法,包括AVL tree，Search tree, Threaded tr-some algorithms about tree, including AVL tree，Search tree, Threaded tree
print-tree
- priority search tree for mapping->i_mmap
searchtree
- linux上面c++的二叉搜索树实现，包含声明左值、右值，地带器实现-binary search tree
BSTree
- Python 实现 Binary Search Tr-Implement binary search tree in Python
Two-insert-search-tree
- 包含查找最大值、最小值的二叉搜索树方法，程序简洁明了-Binary search tree method comprising find the maximum, minimum, clear and concise program
examble
- 数据结构二叉 搜索树的实现很好的例子！不错,很好(The realization of the data structure of binary search tree good example!)