Question

1. Stack is useful for implementing
(A) radix sort
(B) breadth first search
(C) quick sort
(D) recursion​

Answer 1

Answer:

breadth first search

Stack implementation is useful for understanding recursion. Explanation: Stack is a linear data structure where its components are arranged in a straight line or stacked

Hope it may help you...

Please follow me...

And mark this answer as Brainiest answer...

Answer 2

The given question is. Stack is useful for implementing

(A) radix sort

(B) breadth-first search

(C) quick sort

(D) recursion

we have to find which of the option is correct.

First, let us understand the definition of a stack.

A stack is a linear data structure.

Its components are arranged in a straight line or stacked.

It is a conceptual structure consisting of a set of homogeneous elements.

The stack follows a LIFO principle.

LIFO stands for Last In First Out.

The two operations used in the stack are push and pop operations.

recursion stands for a process of defining a problem in terms of itself.

Recursion is also known as repetition.

Therefore, based on the above observation, the final answer to the given question is recursion

Hence, option D is correct.

# spj6