Question

Which one of the following statements is true?

• A. Every stack is a priority queue
• B. A linear queue is empty if front = rear
• C. A binary tree with n nodes will have \( \left\lfloor \frac{n}{2} \right\rfloor \) leaf nodes
• D. A directed acyclic graph is a tree

Hint:

A stack follows the LIFO principle, and under certain conditions, it can be considered a form of priority queue.

Answer 1

The Correct Option is A

In a stack, the last element inserted is the first element to be removed (LIFO order). This matches the behavior of a priority queue where elements are processed in a specific order, depending on their priority. Hence, every stack can be considered a priority queue under specific conditions.
Thus, the correct answer is \( \text{Every stack is a priority queue} \).