Computer Science, asked by 121910306029, 4 months ago

How many edges of this binary tree violate the min-heap property? In other words, for how many edges of the tree, the parent value is greater than the value of the child?

Answers

Answered by srutisanti30

0

ANSWER IS The edges of the tree will be 4. The min heap is a total binary tree such that the value in each node is lower than the child node.

Previous Question

Next Question

Similar questions

Hindi, 2 months ago

त्तांत-लेखन: महात्मा गांधी विद्यालय, जवाहरलाल नेहरू रोड, रत्नागिरी में बालदिवस समारोह का 60 से 70 शाहले में वृत्तांत-लेखन कीजिए। (वृत्तांत में स्थल, काल, घटना का उल्लेख होना आवश्यक है।)...

English, 2 months ago

. Identify the verbs in these sentence Plucking flowers should be discouraged ...

Math, 2 months ago

plzz solve it with explanation!!!

English, 4 months ago

full form of lbb........

Math, 4 months ago

certain % of rebate on marked price is called _________...

Math, 8 months ago

(49.9)² Solve using Identities.

Social Sciences, 8 months ago

what are the 3 processes of population change and growth with explanation plz answer..

Math, 8 months ago

write the value of 4cos cube45°-3cos45...