搜索资源列表
LibrarySimulator_FINAL
- j2se程序，实现AVL Tree，并利用该数据结构模拟图书馆借阅系统，加速海量数据的索引-j2se procedures, AVL Tree, and using the data structure simulate the library system, Massive data accelerated the index
chapter9
- 数据结构与算法分析中AVL Tree的JAVA详尽代码 请有需要的同学下载
Tree
- avl tree and bplus tr-avl tree and bplus tree
AvlTree
- AVL tree with additional function
AVLTree
- avl tree implementation
AVLtree
- AVL tree using node from data structure and algorithm java class, create a minimum AVL tree with minimum number of nodes at given high
RBTree
- 红黑树的JAVA实现。红黑树仍然不是平衡树，但是统计性能要好于AVL树。要保持红黑树的规则，主要通过两类操作，一类是换色，一类还是旋转。-JAVA red-black tree implementation. Red-black tree is still not balanced tree, but the statistical performance is better than the AVL tree. Red-black tree to keep the rules, mainly
AVL
- AVL tree。 AVL树的源代码。以及基本函数-AVL tree
Data-structures
- Data Structures in java which helps us to describe the data structures like linked list,hash dictionary,avl teel,binary search tree,array list and all util package
AVLTreeImp
- AVL tree implementation
AVLTree
- AVL tree implementation in java
AVL
- AVL tree operations.
AVL
- AVL Tree program on how to insert a new node algorithm using AVL.
ArbolAVL
- The AVL tree is named after the initials of the surnames of its inventors, Adelson-Velskii and Landis. He came forward in the publication of an article in 1962: "An algorithm for the organization of information" ("An algorithm for the organization of
AVL-tree
- This program implements the behaviour of an AVL tree.
AVLTree
- AVL tree this file contain two classes: AVLtree and AVLNode
avl
- avl tree program in java
AVL
- 利用Java语言编写的Java平衡二叉树，适合初学者学习Java时作参考资料-As a reference when you use the Java language Java balanced binary tree, suitable for beginners to learn Java
TREE_INT
- Tree AVL 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 one, rebalancing is done to restore this property. Lookup, insertion, and deletion all take O(log n) time in bo
RedBlackBST
- 红黑树和AVL树一样都对插入时间、删除时间和查找时间提供了最好可能的最坏情况担保。这不只是使它们在时间敏感的应用如实时应用（real time application）中有价值，而且使它们有在提供最坏情况担保的其他数据结构中作为建造板块的价值；例如，在计算几何中使用的很多数据结构都可以基于红黑树。(a red black tree is a self balancing tree that could balance it self)