搜索资源列表
vv
- 线性表的应用 haffman树和haffman编码 构造平衡二叉树的源码-Application of linear haffman Table haffman coding trees and balanced binary tree structure of the source
bltree
- c++实现的创建一棵平衡二叉树（注释的很详细哦）-c++ to achieve a balanced binary tree (oh, very detailed notes)
bstree
- c#实现的平衡二叉树操作，balance binary tr-balance binary tree, c#
BiTree
- 平衡二叉树的基本操作，包括插入，删除，修改-The basic operation of a balanced binary tree, including the insertion, deletion, modification
AVL
- 平衡二叉树的基本操作.包括查找、插入、删除、合并等操作-AVL Basic Functions
BinaryTree
- （1）根据给定二叉树的先序遍历和中序遍历结果，构造出该二叉树； （2）给出该二叉树的后序遍历结果； （3）判定该二叉树是否为平衡二叉树； -(1) According to the given binary tree preorder traversal and inorder traversal a result, constructed out of the binary tree (2) given in the post-order traversal of the bin
shujujiegoukechengsheji1
- 单链表的基本操作和栈的运算，平衡二叉树的生成为题目的数据结构课程设计。有详细的文字说明和源代码。-Single list of the basic operations and stack operations, balanced binary tree data structures of Health to become the subject curriculum design. A detailed written instructions and source code.
AVL.doc
- 次代码是实现平衡二叉树的数据结构算法。参考的是严蔚敏c和c++数据结构书上的思想。经过调试可以连续实现删除、插入、查找算法-Sub-code is to achieve a balanced binary tree data structure algorithms. Reference is Yan Wei-Min c and c++ data structure book ideas. Debugging can be achieved through a continuous delete
MYBSTree
- 平衡二叉树的实现，包括插入，删除，新建等工作，主要用于排序用-A balanced binary tree implementation, including insert, delete, new work, mainly for sorting by
binarytree
- 二叉树的建立，查找，删除，平衡二叉树最小二叉树，二叉树的界面显示-The establishment of a binary tree, find, delete, balanced binary tree the smallest binary, binary interface display
homework4
- AVL Tree （平衡二叉树）功能描述及源文件-AVL Tree (balanced binary tree) function descr iption and source files
balancetree
- AVL平衡二叉树来进行排列操作，以实现时间优化-avl
bstree
- 数据结构的课程设计，实现平衡二叉树；1）输入一组数据，建立一棵平衡二叉树 （2）输入一个数据，在平衡二叉树中查询-bstree
src
- 平衡二叉树java版 平衡二叉树java版-Java version of a balanced binary tree balanced binary tree balanced binary tree java version java version of
Tree
- 用C语言编写的构造平衡二叉树和程序,可进行各种类型的调整-C program
Tree
- C语言编写的构造平衡二叉树的小程序,总共有四个操作功能-C program
blacklist
- 黑名单设计，用C语言写的一个黑名单的快速查找，用哈希平衡二叉树算法-Black design, with the C language written in a blacklist to quickly find, use a balanced binary tree hashing algorithm
avlTree
- 平衡二叉树，又称AVL树。它或者是一棵空树，或者是具有下列性质的二叉树：它的左子树和右子树都是平衡二叉树，且左子树和右子树的高度之差之差的绝对值不超过1.。 -Balanced binary tree, also known as AVL tree. It is either an empty tree, or a binary tree with the following properties: it left sub-tree and right sub-trees are bala
BalenceTwoTree
- 数据结构中的平衡二叉树的C++实现，平衡二叉树可以说是比较难的一点，希望对你有所帮助。-Balanced binary tree data structure in the C++ implementation, balanced binary tree can be said is more difficult point, want to help you.
balancebinarytree
- 平衡二叉树，功能包括插入删除节点，保持平衡性-Balanced binary tree, features include insert and delete nodes, to maintain balance