Question

Difference between stack and linked list in data structure

Answer 1

Stack is basically where the last data entry is the first to be processed. The last entry is "popped" and the data is then used. 
Linked List is a dynamic array where each data entry is basically a structure datatype. You can implement Stack format using Linked Lists.
Stack is an arrangement of data whereas Linked List is an implementation of Structure Datatype to ensure no memory space gets wasted.

Answer 2

Difference between stack and linked list in data structure  is given below

Explanation:

• The stack is using the technique last in first out it means the element which is inserted at the last we will access that element in the first whereas there are no such rules in the linked list.
• The linked list provides dynamic memory allocation so the memory is not waste if we using a linked list whereas in the stack there is always a wastage of memory that takes place.
• We can easily access the element of the stack because there is no concept of the pointer in the linked list we can not access the element easily.

Learn More:

• brainly.in/question/636529
• https://brainly.in/question/16112226