搜索资源列表
f
- 一些查找的程序，第一个是二叉查找树，后面两个是其扩展-Some find the procedure, the first is a binary search tree, behind two of its expansion
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
erchashu
- 二叉树的查找与构成及其形成原理，对于二叉树的查找原理！-Find the tree and its form and principle, the principle of the binary tree search!
erchashu.txt
- 包括二叉树的建立和查找，是查找算法的一种，大家可以看看，参考一下。-Including the establishment of a binary tree and search is a search algorithm, we can see that reference.
xjjg
- 数据结构课程设计中自己做的一个显示二叉查找的过程的一个程序-Curriculum design, data structure to do a show in its own binary search process of a program
binarysearchtree
- 二叉查找树的各种函数 包括初始化 插入 删除 各种遍历-Binary search tree insertion deletion of various functions, including initialization of various traversal
BinarySearchTree
- 二叉查找树，它或者是一棵空树；或者是具有下列性质的二叉树： （1）若左子树不空，则左子树上所有结点的值均小于它的根结点的值； （2）若右子树不空，则右子树上所有结点的值均大于它的根结点的值； （3）左、右子树也分别为二叉排序树；-Binary search tree
bst
- 实现了二叉查找树的各种功能, 如查找\删除\插入等,结构比较清晰-The various functions of the binary search tree, such as Find \ delete \ insertion, the structure is relatively clear
BinarySearchTree
- 用C++实现的二叉查找的cpp文件主要部分。-Using a binary search C++ achieve the cpp file main sections.
AVL_tree
- 在计算机科学中，AVL树是最先发明的自平衡二叉查找树。AVL树得名于它的发明者 G.M. Adelson-Velsky 和 E.M. Landis，他们在 1962 年的论文 "An algorithm for the organization of information" 中发表了它。 -In computer science, AVL tree is a self-balancing binary search tree first invented. AVL tree is name
Binary_Tree
- 二叉树是每个节点最多有两个子树的有序树。通常子树被称作“左子树”（left subtree）和“右子树”（right subtree）。二叉树常被用于实现二叉查找树和二叉堆。值得注意的是，二叉树不是树的特殊情形。在图论中，二叉树是一个连通的无环图，并且每一个顶点的度不大于3。-Each node in a binary tree is an ordered tree up to two sub-tree. Usually sub-tree is called " left sub-tre
btree
- 二叉查找 包括 中序遍历 插入 删除 查找 打印二叉树等各种 有关于二叉树的操作-Binary search, including preorder insert delete find various operations, such as printing a binary tree binary tree about
binary-search-tree-algorithm
- 二叉查找树的简单算法实现，包括增删查找等功能-the algorithm of binary search tree
bintree
- 二叉查找树的建立查找插入删除，有详细的源代码-Build a binary search tree to find insertion and deletion, a detailed source code
AVL
- AVL树是最先发明的自平衡二叉查找树。在AVL树中任何节点的两个儿子子树的高度最大差别为一，所以它也被称为高度平衡树。查找、插入和删除在平均和最坏情况下都是O（log n）。-AVL tree is a self-balancing binary search tree first invented. AVL tree height in any node of the biggest differences between the two sons of a sub-tree, it is a
BinarySearchTree
- 二叉查找树，C++语言编写的二叉查找树，挺好的东西-Binary search trees, written in c++ language bintree, quite good
BinarySearchTree
- 根据用户输入的一系列整数，生成一棵二叉查找树。对该二叉查找树实现中序遍历，生成排序后的整数数列。对该二叉查找树进行中序遍历，计算累加和。-According to a series of integer user input and generates a binary search tree. The realization of a binary search tree traversal generates integer sequence sorted. The binary searc
c二叉查找树
- 二叉树查找算法，是c数据结构的内容比较难做我做了很长时间才做出来(Two tree search algorithm, C data structure is more difficult to do, I have done a long time to do it)
二叉排序树的建立查找插入和删除
- 二叉树的建立，插入，以及排序的完整实现。(The establishment of the two fork tree, insert, sort and complete implementation.)
二叉树
- 基于二叉查找树进行优化，进而可以得到其他的树表查找算法，如平衡树、红黑树等高效算法(Based on the two fork search tree, we can optimize other tree table lookup algorithms, such as balanced tree, red black tree and other efficient algorithms.)