Data Structures

In computer science, Dequeue refers to which of the following?

• A. A self-balancing tree data structure that maintains sorted data and allows searches, insertions, and deletions in logarithmic time, commonly used in databases.
• B. A matrix in which most of the elements are zero, often stored using specialized structures to save memory.
• C. An abstract data structure where each element has a priority, and elements are served according to that priority rather than arrival order.
• D. A data structure that allows insertion and removal of elements from both the front and the back. ✓