Home / Engineering / Data Structure (DS) / Question
M
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.
Related MCQs on Data Structure (DS)
Q. Which of the following is not a type of Linked List ?
Q. Which is required skill of a Tester?
Q. . ______________databases are owned by particular departments or business groups.
Q. Before handing over the software to the client, which testing is to be done in-house?
Discusssion
Login to discuss.