Data Structure
Java
Python
HTML
Interview Preparation
- Interview Prep
- Tutorials
- Tracks
C-Programming-data-structure || 2015 SET 1 || MCQ || 2-mark || Module 3: Tree | Graph | Hashing
Last Updated :
Discuss
Comments
Consider a max heap, represented by the array: 40, 30, 20, 10, 15, 16, 17, 8, 4. Now consider that a value 35 is inserted into this heap. After insertion, the new heap is
2015 SET 1 || MCQ || 2-mark
40, 30, 20, 10, 15, 16, 17, 8, 4, 35
40, 35, 20, 10, 30, 16, 17, 8, 4, 15
40, 30, 20, 10, 35, 16, 17, 8, 4, 15
40, 35, 20, 10, 15, 16, 17, 8, 4, 30
This question is part of this quiz :
GATE|| C Programming & Data Structure || Pyqs (2010 to 2025 ),GATE || Tree | Graph || PYQS (2010 to 2025)Share your thoughts in the comments
GeeksforGeeks
Article Tags :