Homechevron_rightEngineeringchevron_rightComputer Sciencechevron_rightData Structurechevron_rightIn a Heap tree

In a Heap tree

  • Q. In a Heap tree
  • 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. Why is heap implemented using array representations than tree(linked list) representations though both tree representations and heaps have same complexities?

    for binary heap

    -insert: O(log n)

    -delete min: O(log n)

    for a tree

    -insert: O(log n)

    -delete: O(log n)

    Then why go with array representation when both are having same values ?
  • filter_dramaExplanation
    Answer is : D
    None.
  • 2. In a min heap
  • filter_dramaExplanation
    Answer is : C
    None.
  • 3. What is the best case complexity in builading a heap?
  • filter_dramaExplanation
    Answer is : D
    None.
  • 4. For construction of a binary heap with property that parent node has value less than child node.In reference to that which line is incorrect. Line indexed from 1.
  • filter_dramaExplanation
    Answer is : B
    None.
  • 5. Choose the correct properties of weak-heap.
  • filter_dramaExplanation
    Answer is : B
    None.

Data StructureTopics

leaderboardLeaderboard
  • Rahul Kumar

    191 Points

  • VIKRAM JEET

    54 Points

  • GEETHIKA CHOWDARY

    53 Points

  • sunita saini

    52 Points

  • Zain

    49 Points