Data Structures

Step 1: Understand the LIFO principle.
LIFO means the element that is inserted last will be removed first.
Step 2: Analyze data structures.
A Stack follows the LIFO principle where insertion (push) and deletion (pop) occur at the same end.
A Queue follows FIFO (First In First Out).
Linked Lists and Trees do not strictly follow LIFO.
Step 3: Conclusion.
Therefore, the data structure that works on the LIFO principle is Stack.