Data Structure
Java
Python
HTML
Interview Preparation
- Interview Prep
- Tutorials
- Tracks
GATE | CS | 2019 | Algorithm | Complexity Analysis | Question 49
Last Updated :
Discuss
Comments
Consider the following statements:
- I. The smallest element in a max-heap is always at a leaf node.
- II. The second largest element in a max-heap is always a child of the root node.
- III. A max-heap can be constructed from a binary search tree in Θ(n) time.
- IV. A binary search tree can be constructed from a max-heap in Θ(n) time.
Which of the above statements is/are TRUE?
II, III and IV
I, II and III
I, III and IV
I, II and IV
This question is part of this quiz :
GATE CS 2019,Algorithms GATE CS PYQ Quiz,Complexity Analysis GATE CS PYQ QuizShare your thoughts in the comments
GeeksforGeeks