Red Black Trees

Red Black Trees - 2 The root is black 3 Every leaf if black...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
SEARCH INSERT DELETE Array O(n) O(1) O(n) Sorted Array O(logn) O(n) O(n) List O(n) O(1) O(n) Sorted List O(n) O(n) O(n) BST (red black) n-node O(logn) O(logn) O(logn)
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Red black trees 1. Every node is either black or white
Background image of page 2
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: 2. The root is black 3. Every leaf if black 4. Every red node has two black children 5. All node x : all paths from x to a leaf in the subtree of x...
View Full Document

This note was uploaded on 10/25/2009 for the course COMP 3804` taught by Professor Anil during the Spring '09 term at Carleton.

Page1 / 2

Red Black Trees - 2 The root is black 3 Every leaf if black...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online