Question

When we implement stack by using linked list then:
A. Insertion of the node is done from the end and deletion from the end
B. Insertion of the node is done from beginning and deletion from end

C. Insertion of the node is done from beginning and deletion from beginning

D. Insertion of the node is done from end and deletion from beginning hop

Answer = A & C​

Answer 1

Answer:

A

Explanation:

A. Insertion of the node is done from the end and deletion from the end

Answer 2

B. Insertion of the node is done from the beginning and deletion from the end.

Implement stack by using linked list :

• If network applications are inserted at the starting of a linked list during a push operation, nodes must be removed at the end during a pop operation.

• The fundamental advantage of linked lists over arrays is that they may be used to create a stack that can decrease and grow as needed.

• When you use an array, you're limiting the array's maximum capacity, which can lead to stack overflow. Each new node will be allocated dynamically.