দ্বৈত শাসন ব্যবস্থার প্রবর্তক-

Question:

Which of the following data structures operates on a Last-In, First-Out (LIFO) basis?

Options:

        
• A) Queue
        
• B) Stack
        
• C) Array
        
• D) Binary Tree
    

Correct Answer: B) Stack

Explanation:

A Stack is an abstract data type that serves as a collection of elements, characterized by two principal operations: push (which adds an element to the collection) and pop (which removes the most recently added element). Because the last item added is the first item removed, it follows the Last-In, First-Out (LIFO) principle.

Why other options are incorrect:

        
• Queue: Follows the First-In, First-Out (FIFO) principle, where elements are removed in the same order they were inserted.
        
• Array: A random-access data structure where elements can be retrieved or modified directly via indices, regardless of insertion order.
        
• Binary Tree: A hierarchical, non-linear data structure where each node has at most two children, not governed by sequential LIFO behavior.