Select Keyboard:
Türkçe ▾
  1. Türkçe
  2. English
  3. العربية
  4. Dansk
  5. Deutsch
  6. Ελληνικά
  7. Español
  8. فارسی
  9. Français
  10. Italiano
  11. Kurdî
  12. Nederlands
  13. Polski
  14. Português Brasileiro
  15. Português
  16. Русский
  17. Suomi
  18. Svenska
  19. 中文注音符号
  20. 中文仓颉输入法
X
"1234567890*-Bksp
Tabqwertyuıopğü,
CapsasdfghjklşiEnter
Shift<zxcvbnmöç.Shift
AltGr

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ː/
المفضلات