Homechevron_rightEngineeringchevron_rightComputer Sciencechevron_rightData Structurechevron_rightThe running time for creating a heap of size n is .............

The running time for creating a heap of size n is .............

  • Q. The running time for creating a heap of size n is .............
  • 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. What is the other name of weak heap?
  • filter_dramaExplanation
    Answer is : C
    None.
  • 2. 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.
  • 3. The number of trees in a binomial heap with n nodes is
  • filter_dramaExplanation
    Answer is : A
    None.
  • 4. If we implement heap as maximum heap , adding a new node of value 15 to the left most node of right subtree . What value will be at leaf nodes of the right subtree of the heap.

    data-structure-questions-answers-heap-q7
  • filter_dramaExplanation
    Answer is : A
    None.
  • 5. The leaf node for a heap of height h will be at which position.
  • 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