For an n-element min-Heap:

For an n-element min-Heap:

1. a) the smallest element can be found anywhere in the heap
2. b) It is a type of binary search tree.
3. c) accessing an arbitrary element is an O(n) operation.
4. d) the largest element is always at the root.