LIST

LIST :
Stack,Queue
flexible structure because they can grow and shrink on demand, and elements can be accessed, inserted, or deleted at any position within a list.
can also be concatenated together or split into sublists
applications such as information retrieval, programming language translation, and simulation
Implementation of lists:
Array Implementation of Lists
Single/Doubly Linked Lists
Pointer Implementation of Lists

Stacks:
n which all insertions and deletions take place at one end, called the top.
stack are "pushdown list," and "LIFO" or "lastin-first-out" list

Queues:
items are inserted at one end (the rear)and deleted at the other end (the front)
"FIFO" or "first-in first-out" list.