Homechevron_rightEngineeringchevron_rightComputer Sciencechevron_rightData Structurechevron_rightIn a max heap, element with the greatest key is always in the which no...

In a max-heap, element with the greatest key is always in the which no...

  • Q. In a max-heap, element with the greatest key is always in the which node?
  • filter_dramaExplanation
    Answer is : C
    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. The Statement
  • filter_dramaExplanation
    Answer is : A
    None.
  • 2. 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.
  • 3. The total comparisons in finding both smallest and largest elements are
  • filter_dramaExplanation
    Answer is : B
    None.
  • 4. What is the space complexity of searching in a heap?
  • filter_dramaExplanation
    Answer is : B
    None.
  • 5. The main distinguishable characterstic of a binomial heap from a binary heap is that
  • filter_dramaExplanation
    Answer is : A
    None.

Data StructureTopics

leaderboardLeaderboard
  • Rahul Kumar

    191 Points

  • VIKRAM JEET

    54 Points

  • GEETHIKA CHOWDARY

    53 Points

  • sunita saini

    52 Points

  • Zain

    49 Points