Effective BST approach to find underflow condition in interval trees using augmented data structure

Abstract

In many trivial or complex situation augmentation of a data structure would required. To solve real world complex problem augmentation of data structure is must by creating entirely new data structure using existing data structure by adding some additional information like Minimum, Maximum, Successor, and Predecessor in it. Augmentation of data structure is not that much straightforward. This approach is developed with respect to existing data structure of BST (Binary Search Tree) and some additional information. So, in this attempt we presented BST as underlying data structure for interval tree, which leads to easy implementation, reduced searching complexity and less memory requirement. © 2010 Springer-Verlag Berlin Heidelberg.