a) What is the height of the tree?

b) Is this a complete tree?

c) Is this a binary search tree?

d) Calculate the post-order traversal of the tree

e) Convert the above tree to a max-heap, draw the resulted heap and the array used to store the elements.

f) Draw the tree that results from the insertion the elements of (d) according their order.

g) Is this a complete tree?

h) Convert the tree in (f) to a max-heap.

i) Redrew the heap after removing the root element.

Given the follawina tran