Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Programming and Data Structure Binary Heap Binary Search Tree
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 are TRUE?
1
I, II and III
2
I, II and IV
3
I, III and IV
4
II, III and IV