Stack is useful for implementing
-
radix sort
-
breadth first search
-
recursion
-
none of these
C
Correct answer
Explanation
A stack operates on a Last In, First Out (LIFO) basis, which is the exact mechanism used to manage function calls, activation records, and return addresses in recursion.