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

  • Author
    Posts
  • #1428024 Reply
     EduGorilla 
    Keymaster
    Select Question Language :


    Initially a priority queue had 5 elements and it is being implemented as Max-Heap. Let’s say the level order traversal of the heap is: 30, 18, 17, 12, 11. Now two more elements are inserted into the heap i.e. 10 and 19 in the same order. The level order traversal of the heap after the insertion is:

    Options :-

    1. 30, 18, 19, 12, 11, 10, 17
    2. 30, 19, 18, 12, 11, 17, 10
    3. 30, 18, 17, 12, 11, 10, 19
    4. 30, 18, 19, 12, 11, 17, 10
    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: Initially a priority queue had 5 elements and it is being implemented as Max-Heap. Let’s say the l….
Your information:




Verify Yourself




Log in with your credentials

or    

Forgot your details?

Create Account