What if union of disjoint sets results in universal set?

Problems 10-2: Mergeable heaps using linked lists?

• Problems 10-2: Mergeable heaps using linked lists A mergeable heap supports the following operations: MAKE-HEAP (which creates an empty mergeable heap), INSERT, MINIMUM, EXTRACT-MIN, and UNION.[1] Show how to implement mergeable heaps using linked lists in each of the following cases. Try to make each operation as efficient as possible. Analyze the running time of each operation in terms of the size of the dynamic set(s) being operated on. a. Lists are sorted. b. Lists are unsorted. c. Lists are unsorted, and dynamic sets to be merged are disjoint.

• Answer:

  This is the category for Yahoo! 360 profile pages not the Xbox 360 game unit. You might want to either post this question here: http://answers.yahoo.com/dir/index;_ylt=AjUpcdH3xJFwhZa.WZj5Sjnpy6IX;_ylv=3?sid=2115500151 or visit this site: http://forums.xbox.com/10098857/ShowPost.aspx