5- We are implementing an iterator that traverses the tree in the following order: a) Pre-Order. Give the state of the stack right after key 115 has been popped.

Bottom of stack _____________________________________ < -- > Top of stack

b) In-Order. Give the state of the stack right after key 88 has been popped.

Bottom of stack _____________________________________ < -- > Top of stack

c) Level-Order. Give the state of the queue right after key 5 has been dequeued.

Front of queue < ___________________________________ < Back of queue