Homechevron_rightEngineeringchevron_rightComputer Sciencechevron_rightData Structurechevron_rightIf we implement heap as min heap , deleting root node (value 1)from th...

If we implement heap as min-heap , deleting root node (value 1)from th...

  • Q. If we implement heap as min-heap , deleting root node (value 1)from the heap. What would be the value of root node after second iteration if leaf node (value 100) is chosen to replace the root at start.

    data-structure-questions-answers-heap-q6
  • filter_dramaExplanation
    Answer is : A
    None.

Discussion

    No one started the discussion yet. Break the ice and start the conversation.
    Please Login to be part of the discussion.

Similar Questions

  • 1. What is the complexity of adding an element to the heap.
  • filter_dramaExplanation
    Answer is : C
    None.
  • 2. Heap exhibits the property of a binary tree?
  • filter_dramaExplanation
    Answer is : A
    None.
  • 3. What is the worst case time in searching minimum value in weak -heap?
  • filter_dramaExplanation
    Answer is : D
    None.
  • 4. Given an array of element 5,7,9,1,3,10,8,4. Tick all the correct sequences of elements after inserting all the elements in a min-heap.
  • filter_dramaExplanation
    Answer is : A
    None.
  • 5. In a min heap
  • filter_dramaExplanation
    Answer is : C
    None.

Data StructureTopics

leaderboardLeaderboard
  • Rahul Kumar

    191 Points

  • VIKRAM JEET

    54 Points

  • GEETHIKA CHOWDARY

    53 Points

  • sunita saini

    52 Points

  • Zain

    49 Points