5. Assume I have a stack s, a queue q, and a binary search tree t. Initially all of them
are empty. Indicate the state of the data structures at line number 7 and at the end. What
is the maximum height each of the data structures had during the execution?
1 i $\rightarrow$ 0
2 while i <= 9 do
3 q.put(2 .i)
4 s.push(2 .i + 1)
5 i $\rightarrow$ i + 1
6 end
7 i $\rightarrow$ 0
8 while i <= 9 do
9 t.insert(s.pop())
10 t.insert(q.get())
11 i $\rightarrow$ i + 1
12 end