Homechevron_rightEngineeringchevron_rightComputer Sciencechevron_rightData Structurechevron_rightWhy is heap implemented using array representations than tree(...

Why is heap implemented using array representations than tree(...

  • Q. 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.

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. What is the worst case time in searching minimum value in weak -heap?
  • filter_dramaExplanation
    Answer is : D
    None.
  • 3. Does there exist a heap with seven distinct elements so that the Inorder traversal gives the element in sorted order.
  • filter_dramaExplanation
    Answer is : B
    None.
  • 4. What is the other name of weak heap?
  • filter_dramaExplanation
    Answer is : C
    None.
  • 5. The worst case complexity of deleting any arbitrary node value element from heap is
  • 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