How to merge 2 heaps efficiently (say in O(log m * log n) time where 'm' is the number of nodes in first heap and 'n' is the number of nodes in second heap?
Printable View
How to merge 2 heaps efficiently (say in O(log m * log n) time where 'm' is the number of nodes in first heap and 'n' is the number of nodes in second heap?