# Max heap conversion

In the binary tree shown below, which of the following trees is created after conversion into a (max) heap?

There are 4 anwsers to choose :

By definition, a max heap is a complete binary tree in which the value in each internal node is greater than or equal to the values in the children of that node., so a, c, d are all correct, but there is only one correct anwser!

What am i missing here ?

• Other than the typo, a very nice question. Option b with the typo corrected is the one you want. The key here is to move each node into its place, starting within the smaller sub-tree. – InformedA Oct 13 '14 at 5:23

• Thanks for the answer, option B is the correct one indeed, but what I don't get is, the others also satisfy the condition each internal node is greater than or equal to the values in the children of that node ? Why are they wrong? – f855a864 Oct 13 '14 at 5:14