Description: 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 through two operations, one is for color, a class or rotation.
- [java-rbtree-project-ok] - R and B-tree tree of mixed tree, in the
- [studentNoSQL] - our operations, is not linked to the dat
- [20043048] - Dynamic demonstration of the definition
- [AVLtree] - AVL tree using node from data structure
- [rbtree] - Red-black tree, binary search tree imple
File list (Check if you may need any files):
RBTree.java