This topic contains 0 replies, has 0 voices, and was last updated by  EduGorilla 2 years, 4 months ago.

  • Author
    Posts
  • #1431069 Reply
     EduGorilla 
    Keymaster
    Select 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.

    Options :-

    1. Only I and IV is correct
    2. Only I and III is correct
    3. Only II and IV is correct
    4. Only II and III is correct
    Post your Training /Course Enquiry
    Are You looking institutes / coaching center for
    • IIT-JEE, NEET, CAT
    • Bank PO, SSC, Railways
    • Study Abroad
    Select your Training / Study category
Reply To: Consider a binary skew heap tree. This skew heap is same as ordinary heap tree with just one change ….
Your information:




Verify Yourself




Log in with your credentials

or    

Forgot your details?

Create Account