← Back to Test

Problem 14 - Entrance Test

Which of the following is the most accurate definition of a stack data structure?

Correct: C

A stack is a linear data structure that operates on the Last-In-First-Out (LIFO) principle. This means the last element added to the stack is the first one removed. Queues follow FIFO, and trees/graphs are examples of hierarchical structures. Double-ended queues (deques) allow additions/removals from both ends.