McqMate

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

A. | 2 |

B. | 100 |

C. | 17 |

D. | none |

Answer» A. 2 |

3.4k

0

Do you find this helpful?

40

View all MCQs in

Data Structures (DS)No comments yet

- The worst case complexity of deleting any arbitrary node value element from heap is
- Shell sort is applied on the elements 27 59 49 37 15 90 81 39 and the chosen decreasing sequence of increments is (5,3,1). The result after the first iteration will be
- 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?
- Given an array arr = {45,77,89,90,94,99,100} and key = 100; What are the mid values(corresponding array elements) generated in the first and second iterations?
- The number of edges from the node to the deepest leaf is called of the tree.
- Any node is the path from the root to the node is called
- To insert element at start, the previous pointer of newly added node would point to ______
- Which data structure allows deleting data elements from and inserting at rear?
- Which data structure allows deleting data elements from front and inserting at rear?