DS | GATE-2011 | Data Structures
- A max-heap is a heap where the value of each parent is greater than or equal to the value of its children. Which of the following is a max-heap? [GATE – 2011]
a.
b.
c.
d.
Answer : b)
DS | GATE-2011 |
- We are given a set of n distinct elements and an unlabeled binary tree with n nodes. In how many ways can we populate the tree with the given set so that it becomes a binary search tree? [GATE – 2011]
a. 0
b. n!
c. 1
d.
Answer : c)