algorithm - Generate a sorted key for a sorted value -


i need maintain mapping key string value, , mapping value key. need make sure both of these lists sorted @ times. new values can added list @ time. best data structure(s) use when new value added, can maintain 2 sorted lists without having regenerate many keys , without ending unbalanced tree?

could described "in problem, out goal maintain linked list explicit label each node such labels monotonic throughout list, subject inserting , deleting @ given location."?

this section 3 of http://courses.csail.mit.edu/6.897/spring05/lec/lec24.pdf. show how can maintain table of keys in sorted order, gaps, viewing implicit tree structure, in reorganizing keys within section of table equivalent re-balancing subtree.


Comments

Popular posts from this blog

How to logout from a login page in asp.net -

Stack level too deep error after upgrade to rails 3.2 and ruby 1.9.3 -