Consider the following statements.
(i) In max Heap smallest element is at the leaf node.
(ii) In max Heap second largest element always the child of root.
(iii) Binary search tree can be constructed from max heap in θ(n).
(iv) Max Heap can be build from Binary search tree in θ(n)
Which of the above option is correct?
(a) (i), (ii) and (iii)
(b) (i), (ii) and (iv)
(c) (ii), (iii) and (iv)
(d) (i), (iii) and (iv)
