Problem
Let H be a heap storing 15 entries using the array-list representation of a complete binary tree. What is the sequence of indices of the array list that are visited in a preorder traversal of H? What about an inorder traversal of H? What about a postorder traversal of H?