Properties of deques - fast insert/remove at the begining and the end -> O(1) - slow insert/remove in the middle -> O(N) - slow search -> O(N)
