I have a data structure (a min pairing heap) that I need to print in level order. The ADT is implemented using the leftmost child right list of siblings implementation (a node has a pointer to it's leftmost child and to it's sibling) which I need to print out in level order, so if the data structure happened to look like
5 7 6 8
it would print 1245768. Note: I'm using C++. Can someone help me with this implementation?