3. Consider a complete binary tree represented by an array [19, 14, 28, 15, 16, 7,...

 

Transcribed Image Text:

3. Consider a complete binary tree represented by an array [19, 14, 28, 15, 16, 7, 27, 15, 21, 21, 5, 2]. How many edges of this tree violate the max-heap property? In other words, for how many edges of the tree, the parent value is smaller than the value of the child? Enter answer here 1 point 3. Consider a complete binary tree represented by an array [19, 14, 28, 15, 16, 7, 27, 15, 21, 21, 5, 2]. How many edges of this tree violate the max-heap property? In other words, for how many edges of the tree, the parent value is smaller than the value of the child? Enter answer here 1 point