red-black trees : Java Glossary

home page go to the Java Glossary Home go to the Computer Buyer’s Glossary up jump to foot of page Google search web for more information on this topic Pinterest pin button
* 0-9 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z (all)
©1996-2017 Roedy Green of Canadian Mind Products

red-black trees
This is the modern equivalent of IBM (International Business Machines) ’s old ISAM (Indexed Sequential Access Method) Indexed Sequential Access Method or SoftCraft’s Btrieve. Red-black trees allow you to both iterate through a collection in the proper sequential order and lookup directly by key. A red-black tree is a binary search tree that uses an extra bit on every node to store the node’s colour, (Colour is just an analogy. It has nothing to do with light.) Red-black trees constrain the way that nodes may be coloured in such a way that the tree remains reasonably balanced. This property is important for insuring a good overall performance — red-black trees guarantee that the worst case performance for the most common dynamic set operations is O(log N).

This page is posted
on the web at:

 http://mindprod.com/jgloss/redblacktree.html

Optional Replicator mirror
of mindprod.com
on local hard disk J:

 J:\mindprod\jgloss\redblacktree.html
Canadian Mind Products
Please the feedback from other visitors, or your own feedback about the site.
Contact Roedy. Please feel free to link to this page without explicit permission.

IP:[65.110.21.43]
Your face IP:[3.137.165.119]
You are visitor number