Resolve "big-Oh of stacks/queues"

Two problems to solve. One is the time complexity of a method that adds to the bottom of a stack and the other is the complexity of searching for a particular element in a queue.

In the later the students need to understand that in order to achieve the worst case time complexity we should look into the case when the element is not in the queue in the first place.

Closes #38 (closed)