RB-height

RB-height - r / \ b Node Node b / \ b b / \ b Node Node...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
By following the 4 rules, the RB tree will have a height that is O(logn). Assume a tree with n nodes. Node / \ n=7, height=3 Node Node / \ / \ Node Node Node Node Node
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: r / \ b Node Node b / \ b b / \ b Node Node Node node r / \ b b / \ b Node node Node Node b / \ b b / \ b Node node node node This is a RB tree, height=4...
View Full Document

This note was uploaded on 02/04/2012 for the course CS 251 taught by Professor Staff during the Fall '08 term at Purdue.

Ask a homework question - tutors are online