Heap can be used as

Related MCQs

• 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.
• An array consists of n elements. We want to create a heap using the elements. The time complexity of building a heap will be in order of
• In a max-heap, element with the greatest key is always in the which node?
• What is the complexity of adding an element to the heap.
• The worst case complexity of deleting any arbitrary node value element from heap is
• What is the worst-case time for heap sort to sort an array of n elements?
• For the heap sort, access to nodes involves simple _______________ operations.
• The concatenation of two list can performed in O(1) time. Which of the following variation of linked list can be used?
• A linear list of elements in which deletion can be done from one end (front) and insertion can take place only at the other end (rear) is known as a ?
• A circular linked list can be used for