Concept:
A stack is a linear data structure that follows LIFO (Last In First Out).
Common applications of stack:
• Expression evaluation (Postfix/Prefix)
• Function calls (call stack)
• Recursion handling
Step 1: Analyze each option.
• A: Postfix evaluation → uses stack ✔
• B: Recursion → uses stack ✔
• C: Priority Queue → uses heap, not stack ✘
• D: Function calls → uses stack ✔
Step 2: Conclusion.
Priority Queue is not related to stack.
\[
\boxed{(3)}
\]