This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: Illinois Institute of Technology Department of Computer Science Lecture 9: February 18, 2009 CS 430 Introduction to Algorithms Spring Semester, 2009 1 Augmenting Balanced Trees For particular applications, it is useful to modify a standard data structure to support additional function- ality. Two examples are presented here, order-statistic trees and interval trees. 1.1 Order-Statistic Trees In Lecture 5 (February 4) we discussed the selection problem: given an array, find the k th largest element. Can we modify red-black trees to allow us to solve this problem? Indeed we can, with order-statistic trees. 1 We augment the each node in the red-black tree with its size, where size ( x ) is defined as the number of items in the subtree rooted at x . With this new information, finding the k th largest element of a tree is a simple process which can be performed in O ( height ( T )) timeand since red-black trees are of height O (log n ), the running time of the selection algorithm is O (log...
View Full Document
This note was uploaded on 04/07/2009 for the course CS 430 taught by Professor Kapoor during the Spring '08 term at Illinois Tech.
- Spring '08