Binomial trees in binomial heap with 27 elements
A binomial heap stores a collection of binomial trees whose sizes are powers of two and such that there is at most one tree for each size.

How can you write 27 as a sum of distinct powers of 2? How many powers do you need?