複選題
22. Consider a min-heap. Which of the following statements are true?
(A) For any subtree of a min-heap, the root ol the subtree contains the smallest key occurring
anywhere in that subtree.
(B) An array that is in ascending order is a binary min-heap.
(C) The sequence [1,5,6,7.14, 17,10,23, 13,12] is a binary min-heap.
(D) The largest key muust in a leaf
(E) The smallest key must reside in a leaf
I reside in