Is there a heap T storing seven distinct elements such that a preorder traversal of T yields the elements of T in sorted order $?$ If there is$,$ draw such a heap in the tree format. How about an inorder traversal $?$ If there is$,$ draw such a heap in the tree format. How about a postorder traversal $?$ If there is$,$ draw such a heap in the tree format.

Let these distinct elements be: $1,2,3,4,5,6,7$

Clarification: It can be either a max heap or a min heap.

Given the elements, how can you arrange the elements in a max heap $?$ Is there more than one arrangement $?$ Is there a particular arrangement such that preorder traversal of it leads to a sorted list $?$ Is there a particular arrangement such that inorder traversal of it leads to a sorted list $?...$

If it is not possible with a max heap, then think of the above if it is possible with a min heap $?$