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

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.

So the binary heap is configured as a Binary Search Tree with the external organizing attribute that perhaps the mean price is in the root with maximum value .

Therefore the given statement is true .

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

Respuesta :

Otras preguntas

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