Question

what is the answer ?

Answer 1

5 edges of this tree violate min-heap property.

• Min-heap's property says at every parent node should be greater than its child nodes.

• The root element should be the maximum element of the heap.

• From the diagram of the binary tree constructed by the given elements, it is clear that 15 --> 21 , 16 --> 21 , 14 --> 15 , 14 --> 16 , 19 --> 28 edges are violating the min-heap property, where the first one's are parent nodes and the elements toward which the arrow is directed are child nodes.

Learn more :

• Full binary tree complete binary tree strict binary tree example

        https://brainly.in/question/12679583

• The level-order traversal of the heap after the insertion of the certain elements is:

        https://brainly.in/question/11742036