搜索资源列表
avl
- Addison-Velski 和 Landis (AVL-Tree s)的二叉树，可以在对数时间内进行标准的操作，如插入、搜索和删除。-Addison-Velski and Landis (AVL - Tree s) of the binary tree, the right time for a few of the standard operation, such as insert, delete and search.
avltree1
- 平衡二叉树 生成，可生成、删除树，还可对一棵树的节点进行插入、排序、删除操作-AVL Tree generator
avl_tree
- avl树的插入删除调整等等基本操作及具体实现-AVL tree insertion deletion of adjustments to achieve the basic operation and the specific
AVL
- ALV树完整分析以及C++具体代码的实现，数据结构的难点。-ALV tree analysis and a complete C++ specific code to achieve the difficult data structure.
datastructure
- Datastructure: Linked Lists Stack and Queue Multi-lists Linked Structures Trees Binary Tree Searching and Sorting AVL Tree Red-Black Tree
avl_Tree
- 一个用C++实现的平衡二叉树算法，实现了高度、平衡度、父子节点等-A use of C++ to achieve a balanced binary tree algorithm, to achieve a high degree of balance, such as father and son nodes
AVL
- 自己写的数据结构的AVL树的算法，大二的时候写的，写的不好请不要见怪-Write their own AVL tree data structure of the algorithm, written in his sophomore year when, well written please forgive
capi-0.01.tar
- < 多任务下的数据结构与算法>>一书的配套源代码，含有链表、哈希表、红黑树、AVL树、复合二叉树、无碎片内存管理、垃圾内存管理、多任务遍历等源代码-" " Multi-tasking data structures and algorithms under the " " a book supporting the source code, containing lists, hash tables, red-black tree, AVL
AVL_tree
- 哈尔滨工业大学，计算机科学与技术学院，数据结构，作业五：AVL树相关操作实现-Harbin Institute of Technology, Computer Science and Technology, data structure, operating 5: AVL tree-related operations to achieve
AVL_Tree
- AVL tree with insertion,deletion and balancing height
AVL-Tree
- AVL tree implementation without pointer. Query,Insert,Erase in logN.
avl-tree
- 用c语言实验AVL树，程序需要外加txt文件用来创建被遍历图，相信看了程序后很简单。-AVL tree using c language experiment, procedures used to create the necessary external txt file to be traverse map, I believe after reading procedure is simple.
delete-AVL-tree
- 武汉大学的数据结构C++版实验，要求实现AVL树结点删除-Wuhan University' s version of C++ data structure experiments required to achieve AVL tree node to delete
AVL-Tree
- a sample implementation of AVL tree using c-a sample implementation of AVL tree using c++
AVL-Tree
- AVL tree - is a self-balancing binary search tree. In an AVL tree, the heights of the two child subtrees of any node differ by at most one
Table on AVL-tree
- Class that represent a table of elements with key and values, implemented using AVL tree.
AVL tree operations
- Contains programs for AVL tree operations like insertion, deletion, search etc
AVL-tree
- AVL树的左旋、右旋和左右选，便于将一棵树转化成平衡二叉树-AVL tree of L, D and about the election, facilitate a balanced binary tree is converted to
Root-of-AVL-Tree
- 网易云课堂-陈越、何钦铭-数据结构-2016春 PTA-04-树5 Root of AVL Tree 编译器：python2-An AVL tree is a self-balancing binary search tree. In an AVL tree, the heights of the two child subtrees of any node differ by at most one if at any time they differ by more than on
AVL树
- 二叉树的ADT、搜索树的ADT、平衡二叉树的ADT。AVL树包含了AVL的建立、查找、删除操作。全部使用类模板，方便调用(ADT for binary tree, ADT for search tree, ADT for balanced binary tree. AVL tree contains the establishment of AVL, find, delete operation. All use of class templates, easy to call)