Question $8$

Which conditions must be imposed on a binary tree for it to be considered a heap? Select all that apply.

The binary tree must be complete

The value stored at every node is less than or equal to the values stored at either of its child nodes $($min heap$)$

The binary tree must be implemented with a linked list

None of the other statements are correct; any binary tree can be considered a heap