DATA STRUCTURES AND ALGO C++

(5 marks) Given a heap, write code to output the elements in a left, right, left, right.... order starting from the root. For example, your program should print 77,45,10, and 31 for the following tree. The code should be generic, and should work with any size heap