Disjoint–Set Data Structure (Union–Find Algorithm) | Techie Delight

Introduction to Disjoint Set (Union-Find Data Structure) - GeeksforGeeks

SOLVED:Suppose you implement the disjoint-sets data structure using union-by-rank but not path compression. Give a sequence of m union and find operations on n elements that take Ω(m logn) time.

Understanding Data Structures: Types and Applications

Design a data structure to support the following two operations for a dynamic multiset S of integers, which allows duplicate values: INSERT (S, x) inserts x into S. DELETE-LARGER-HALF (S) deletes the largest ⌈|S| / 2⌉elements from S . Explain how to implement this data structure so that any sequence of m INSERT and DELETE-LARGER-HALF operations runs in O(m) time. Your implementation should also include a way to output the elements of S in O(|S|) time. | Numerade