Computer Sciences > Gate 2019 > Heap Data Structure
Consider the following statements:
Which of the above statements is/are TRUE?
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.
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?
Correct : a
Similar Questions
A complete binary min-heap is made by including each integer in [1, 1023] exactly once. The depth of a node in the heap is the length of the path from the root...
A palindrome is a word that reads the same forwards and backwards. In a game
of words, a player has the following two plates painted with letters.
From...
Which number does not belong in the series below?
2, 5, 10, 17, 26, 37, 50, 64
Total Unique Visitors
Loading......