Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Analysis of Algorithms Max Alekseyev
 

Summary: 1/32
Analysis of Algorithms
Lecture 16
Max Alekseyev
University of South Carolina
November 4, 2010
2/32
Outline
Red-black Trees
Properties
Height and Black-height
Operations on Red-black Trees
Rotation
Insertion
Deletion
3/32
Red-black Trees
Red-black tree is a variation of binary search trees.
Red-black trees are balanced: height is O(lg n), where n is the
number of nodes.

  

Source: Alekseyev, Max - Department of Computer Science and Engineering, University of South Carolina

 

Collections: Biotechnology; Computer Technologies and Information Sciences