A red-black tree is a binary search tree with the following additional
by pjmlp - 2011-05-13 08:47
I did not found such a compreensive article about red-black trees, when looking for the algorithm a few months ago.
by dog - 2011-05-18 13:11
I've discovered a couple of issues when teaching with so called "red black trees":
1. There isn't one type, some books use 2-3-4 trees (as demonstrated in this article) others use 2-3 trees.
2. In terms of simplicity look at Leftist Red-Black trees (http://www.cs.princeton.edu/~rs/talks/LLRB/LLRB.pdf) they are REALLY SIMPLE.
3. Finally, when it comes to real world use, deletion can be a major issue (if you delete a lot in your trees and your trees are big). So I've been using skip lists instead, where maintenance is a bit more straightforward. (Also Java has ConcurrentSkipLists!!)
Your use of this web site or any of its content or software indicates your agreement to be bound by these Terms of Participation.
Copyright © 2015, Oracle and/or its affiliates. All rights reserved. Oracle and Java are registered trademarks of Oracle and/or its affiliates. Other names may be trademarks of their respective owners.