red-black trees : Java Glossary

home page go to the Java Glossary Home go to the Computer Buyer’s Glossary up local find full screen, hide local find menu Google search web for more information on this topic jump to foot of page translate this page with Babelfish punctuation 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-2012 Roedy Green, 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).
STL
CMP homejump to top You can get the freshest copy of this page from: or possibly from your local J: drive (Java virtual drive/mindprod.com website mirror)
http://mindprod.com/jgloss/redblacktree.html J:\mindprod\jgloss\redblacktree.html
logofeedback Please email your feedback for publication, letters to the editor, errors, omissions, typos, formatting errors, ambiguities, unclear wording, broken/redirected link reports, suggestions to improve this page or comments to Roedy Green : feedback email If you want your message kept confidential, not considered for posting, please explicitly specify that.
mindprod.com IP:[65.110.21.43]
view BlogYour face IP:[38.107.179.214]
You are visitor number 13,787.