Tuesday, May 8, 2012

Red black trees here.


Diagram of binary tree. The black root node has two red children and four black grandchildren. The child nodes of the grandchildren are either black nil pointers or red nodes with black nil pointers.
An example of a red–black tree

at

No comments:

Post a Comment

Subscribe to: Post Comments (Atom)