Use the image below to answer the questions. The tree is the entire thing. Thank you!

1. In what order are the keys printed out in a level order traversal?

2. In what order are the keys printed out in a post order traversal?

3. Draw what the resulting tree looks like if G is inserted into this tree.

4. Draw what the resulting tree looks like if H is deleted from this tree.

5. Draw what the resulting tree looks like if E is deleted from this tree.

s E x ) R . M reset links L P on the way up