Internally, a bin heap is typically implemented as a BST that has the additional ordering property that the minimum value is at the root (or the maximum value is at the root, if we chose to make the bin heap to be a max heap). a) True
b) False

True is the correct answer to the given question .

Explanation:

Heap is the complete binary tree that meets the property of organizing the heap There are two types heap max heap and min heap .The value in the heap of every node is greater than or equal to its parent 's value or less then equal to the  parent with there dimension of the minimum value or the maximum value just at the root.

Therefore the given statement is true .

rgwdfresdcfvg rg

explanation:

wevafrw3f