Give a java or cpp code for printing the level order traversal with level no. of each of the binomial trees in a binomial heap data structure.

Output will be as follows:

Printing Binomial Heap... -------------------------

Binomial Tree, B1

Level 0 : 16 Level 1 : 6

Binomial Tree, B2

Level 0 : 19

Level 1 : 12 5

Level 2 : 7 The given output is for an arbitrary random heap.