搜索资源列表
18.二叉排序树的建立
- 本人数据结构学的还可以,所以多传了些数据结构的程序,希望大家多多支持,这个是二叉排序树的建立和查找-data structure can also learn, so most of the more-data structure of procedures in the hope that we can support, this is a binary tree in order to establish and identify
二叉树，图，排序，查找代码
- 二叉树，图，查找，排序的几个代码，用c 写的，能运行。不错的程序哦！-binary tree, map, locate, sort of several code used to write c, can run. Good procedures Oh!
二叉排序树及其查找
- 数据结构 上机 二叉排序树及其查找,包含更新二叉排序树存储二叉排序树上的查找,二叉排序树上的插入,二叉排序树上的删除等-data structure two forks on the plane and you sort tree, update contains two fork-tree storage binary search tree by sequencing, two tree fork insertion sort, two fork of the tree sort delet
mystruct
- 这是一系列关于二叉树的创建,查找,霍夫曼等数据结构编程,-This is a series of binary tree to create, find, Hoffman data structure programming,
balanceAVL
- 编制一个程序实现平衡二叉树的三种基本功能:查找、插入和删除.还有拆分平衡二叉树、合并平衡二叉树.-procedures for the preparation of a balanced binary tree of the three basic functions : Find, insertion and removal. Resolution also balanced binary tree, the merger balanced binary tree.
3
- 图的创建， 二叉树的建立与遍例， 二叉树的算法:含有插入结点,删除结点,和查找方法-Map creation, tree establishment and all over the cases, binary tree algorithms: insert containing nodes, delete nodes, and to find methods
erchashu
- 二叉树的查找与构成及其形成原理，对于二叉树的查找原理！-Find the tree and its form and principle, the principle of the binary tree search!
tree
- 平衡二叉树：插入结点 在平衡二叉排序树BBST上插入一个新数据元素e 删除结点 删除结点过程与插入结点的操作类似，基本过程是：平衡二叉树，找到要删除的结点，删除一个结点，变成二叉树，旋转，变回平衡二叉树。 查找 把给定值与根结点作比较,若给定值大于根结点则查找其右子树,小于则查找其左子树,如此类推。 -Insertion node in the balanced binary sort tree BBST insert a new data element e remov
erchashu.txt
- 包括二叉树的建立和查找，是查找算法的一种，大家可以看看，参考一下。-Including the establishment of a binary tree and search is a search algorithm, we can see that reference.
BinarySearchTree
- 关于二叉树的11种操作，包括二叉树的创建，检验是否为空，求二叉树的深度，二叉树的查找，前序遍历，后序遍历，按层遍历-it is about 11 kinds of binary search tree,including creating,the depth of the tree,postorder,preorder,level of order....
binarytreealgorithms
- 二叉树的各种算法，插入、删除、查找和遍历-Binary tree algorithms, insert, delete, search and traversal, etc.
AVL
- AVL树，哈希树，以及相关算法。平衡二叉树的查找-AVL tree lookup operation
Balanced-binary-tree-operation-two
- 该程序主要是针对平衡二叉树的操作而设计的，程序执行的命令包括： （1）构造平衡二叉树；（2）输入数据； （3）对平衡二叉树的查找、插入、删除操作；（4）结束 -The program is mainly aimed balanced binary tree operation and design, program execution commands include: (a) construct a balanced binary tree (2) the input data
BiTree
- 本算法用于实现二叉树的查找和输出，使用了数据结构中的二叉树结构，精髓在于使用了函数指针。- This algorithm is used to find and implement binary output, use the data structure of the binary tree structure, the essence is the use of function pointers.
c二叉查找树
- 二叉树查找算法，是c数据结构的内容比较难做我做了很长时间才做出来(Two tree search algorithm, C data structure is more difficult to do, I have done a long time to do it)
9月24日dom和事件代码
- 二叉树的遍历，二叉树的查找以及树的定义。字数字数字数(binary tree traversal traversal of binary tree)
二叉树谱
- 进行数据的 整理 排序 删除 添加 查找 修改 操作(Sorting out the data to delete the add lookup modification operation)
二叉排序树的建立查找插入和删除
- 二叉树的建立，插入，以及排序的完整实现。(The establishment of the two fork tree, insert, sort and complete implementation.)
02二叉排序树_BinarySortTree
- 二叉排列树的查找算法，《大话数据结构》里面的。(Lookup algorithm, balance two forked tree, big talk data structure inside.)
二叉树
- 基于二叉查找树进行优化，进而可以得到其他的树表查找算法，如平衡树、红黑树等高效算法(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.)