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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Coreman, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithm. Prentice Hall India PHI
http://www.cs.rochester.edu/~gildea/csc282/slides/C14-augmenting.pdf
Binary Search tree, IISc Banglore, http://lcm.csa.iisc.ernet.in/dsa/node91.html
The Binary Search Tree Property, CSC 378 tutorial: School of Computing, Queen’s University, Canada K7L 3N6, http://research.cs.queensu.ca/~jstewart/applets/bst/bst-property.html
Interval Trees, Winter 1997 Class Notes for 308-251B, McGill University, Quebec, Canada (1997), http://cg.scs.carleton.ca/~luc/1997notes/topic20/#interval
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Upadhyay, K.N., Vasava, H.D., Kapadia, V.V. (2010). Effective BST Approach to Find Underflow Condition in Interval Trees Using Augmented Data Structure. In: Das, V.V., et al. Information Processing and Management. BAIP 2010. Communications in Computer and Information Science, vol 70. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-12214-9_91
Download citation
DOI: https://doi.org/10.1007/978-3-642-12214-9_91
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-12213-2
Online ISBN: 978-3-642-12214-9
eBook Packages: Computer ScienceComputer Science (R0)