double ended queue

listen to the pronunciation of double ended queue
الإنجليزية - التركية
iki uçtan erisimli kuyruk
الإنجليزية - الإنجليزية
An abstract list-type data structure where elements can be added to or removed from the front (head) or the back (tail)
(Bilgisayar) In computer science, a double-ended queue (often abbreviated to deque, pronounced deck) is an abstract data structure that implements a queue for which elements can only be added to or removed from the front (head) or back (tail). It is also often called a head-tail linked list
double ended queue

    الواصلة

    dou·ble ended queue

    التركية النطق

    dʌbıl endıd kyu

    النطق

    /ˈdəbəl ˈendəd ˈkyo͞o/ /ˈdʌbəl ˈɛndəd ˈkjuː/
المفضلات