Open In App

We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy

Data Structures | Heap | Question 12

The elements 32, 15, 20, 30, 12, 25, 16 are inserted one by one in the given order into a Max Heap. The resultant Max Heap is. 

 


(A)

a

(B)



b

(C)

c

(D)

d


Answer: (A)
Explanation:

 


Quiz of this Question
Please comment below if you find anything wrong in the above post
Article Tags :
Data Structures
DSA
Recommended Articles
1. Difference between Binary Heap, Binomial Heap and Fibonacci Heap
2. Data Structures | Heap | Question 2
3. Data Structures | Heap | Question 5
4. Data Structures | Heap | Question 6
5. Data Structures | Heap | Question 7
6. Data Structures | Heap | Question 11
7. Data Structures | Heap | Question 3
8. Data Structures | Heap | Question 4
9. Data Structures | Heap | Question 8
10. Data Structures | Heap | Question 9
11. Data Structures | Heap | Question 1
12. Convert Min Heap to Max Heap
13. Heap Sort for decreasing order using min heap
14. When building a Heap, is the structure of Heap unique?
15. Difference between Min Heap and Max Heap
16. What's the relationship between "a" heap and "the" heap?
17. Does a Data Scientist/Machine Learning Engineer require in depth knowledge of Data Structures and Algorithms?
18. Data Structures | Linked List | Question 1
19. Data Structures | Stack | Question 1
20. Data Structures | Queue | Question 1
21. Data Structures | Stack | Question 2
22. Data Structures | Linked List | Question 2
23. Data Structures | Linked List | Question 3
24. Data Structures | Queue | Question 2
25. Data Structures | Binary Trees | Question 1