Start learning 50% faster. Sign in now
In a binomial heap, the fundamental property is that it follows the min-heap or max-heap order property across its trees. For a min-heap binomial heap, the root of each tree must be the smallest element, meaning it should be less than all its children. Conversely, in a max-heap binomial heap, the root should be greater than all its children. The situation described in the question, where the root is greater than the left child and less than the right child, violates these properties because it suggests an inconsistent ordering.
10                          15                          ?                    Â...
37    59    103    191    ?     719
200, 50, ‘?’, 46.875, 82.03125
22 44 176 1078 8448
...520Â Â 79Â Â 440Â Â 151Â Â Â 376Â Â Â ?
Find the maximum number of trees which can be planted, 25 meters apart, on the two sides of a straight road 2125 meters long
20, 30, 40, 55, ?, 160
4096 2048 514 64 4
...77 ? 190 257 331 412
...366Â Â Â 276Â Â Â 196Â Â Â 126Â Â Â 66Â Â Â ?