Pleeease do not write essays for these. In tech writing, every sentence is on topic. Giving an example is only for when it is needed to help explain the algorithm. Don't just tack an example on the end. This is not trying to define your writing everywhere. Fancy English papers are good in English class. But in a tech class it doesn't make you sound more intelligent, it just makes it seem like you are rambling because you don't know the answer.

A) Explain (no code) how you could detect if a tree was packed as far up and left as possible? (Complete is the word for that.)

B) Define a recursive algorithm that can detect if a tree is in heap order. (Say you've already run he first question so you know the shape is right. You are checking the data.)

9. What are the minimum and maximum numbers of leaves in a complete tree of height h? (A tree with one element is height 0. Remember the AVL assignment. We treated emptiness as height -1 and a leaf as 0. A one element tree is a leaf.)