Explore topic-wise MCQs in Data Structure Questions and Answers.

This section includes 2 Mcqs, each offering curated multiple-choice questions to sharpen your Data Structure Questions and Answers knowledge and support exam preparation. Choose a topic below to get started.

1.	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.
A.	15 and 1
B.	25 and 1
C.	3 and 1
D.	2 and 3
Answer» B. 25 and 1

Discussion

2.	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.	3
Answer» B. 100

Discussion

Explore topic-wise MCQs in Data Structure Questions and Answers.

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.

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.