Dek is a two-way queue where elements can be added or removed from the front or back. It is commonly implemented based on a two-pointers list structure, where each element is represented with a two-pointers node