Let H be a heap storing 15 entries using the array-based representation of a complete binary tree.

What is the sequence of indices of the array that are visited in a preorder traversal of H?

What is the sequence of indices of the array that are visited in an inorder traversal of H?

What is the sequence of indices of the array that are visited in a postorder traversal of H?

Q&A Education