Correct, deques are abstract data types and you can implement them multiple ways, including using linked lists or growable arrays/vectors. So they aren't directly comparable to linked lists since under the hood they can be implemented with linked lists (or doubly linked lists at least). You could compare the performance of different deque implementations, though.