Homechevron_rightEngineeringchevron_rightComputer Sciencechevron_rightData Structurechevron_rightIn binary heap, whenever the root is removed then the rightmost elemen...

In binary heap, whenever the root is removed then the rightmost elemen...

  • Q. In binary heap, whenever the root is removed then the rightmost element of last level is replaced by the root. Why?
  • filter_dramaExplanation
    Answer is : B
    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. In how many different ways can a tree be traversed?
  • filter_dramaExplanation
    Answer is : B
    None.
  • 2. What is the space complexity of the in-order traversal in the recursive fashion? (d is the tree depth and n is the number of nodes)
  • filter_dramaExplanation
    Answer is : D
    None.
  • 3. A-2-3 tree is a tree such that 1. All internal nodes have either 2 or 3 children. 2. All paths from root to the leaves have the same length. The number of internal nodes of a 2-3 tree having 9 leaves could be
  • filter_dramaExplanation
    Answer is : B
    None.
  • 4. The following formula is of :

    left_subtree (keys) ? node (key) ? right_subtree (keys)
  • filter_dramaExplanation
    Answer is : C
    None.
  • 5. What is a Cartesian tree?
  • 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