- 07/13/2019 at 12:58 am #1431069EduGorillaKeymasterSelect Question Language :
Consider a binary skew heap tree. This skew heap is same as ordinary heap tree with just one change that skew heap tree doesn’t need to be balanced. Consider the following statements :
I. Insertion time in skew heap = O(logn)
II. Insertion time in skew heap = O(n)
III. Merging two skew heaps take less time than merging two ordinary heaps.
IV. Merging two skew heaps take more time than merging two ordinary heaps.
Post your Training /Course EnquiryAre You looking institutes / coaching center for
- Only I and IV is correct
- Only I and III is correct
- Only II and IV is correct
- Only II and III is correct
- IIT-JEE, NEET, CAT
- Bank PO, SSC, Railways
- Study Abroad