Unformatted text preview: DELETE, SEARCH and MINGAP as eﬃcient as possible and analyze their running times.) 5. Suppose you want to maintain a set of dynamic intervals (i.e. there are insertions into and deletions from the set) in order to be able to query eﬃciently whether a given interval contains any of the intervals in the set. What data structure would you want to use and what information would need to be stored? Describe an algorithm for implementing the query in suﬃcient detail so that you can analyze the time required to respond to the query. Show that the extra information you need can be maintained during the insertions and deletions. 1...
View
Full Document
 Summer '09
 Splay tree, Tree rotation, Redblack tree, Selfbalancing binary search tree

Click to edit the document details