Computer Science‎ > ‎

Linear Data Structures: Lists, Stacks and Queues.

Stacks : Last in first out (LIFO). Like a pack of cards. 

Queues : First In First Out ( or first come first served ) : FIFO. Like a queue of passengers waiting to buy tickets. The one who has been standing the longest is served first.

Lists : Linear data structures, contain elements, each of which point to the "next" in the sequence as demonstrated in the examples below ( Simple, Circular and Double Linked Lists are some common kinds of lists ) .  Additions and removals can be made at any point in the list - in this way it differs from stacks and queues. 


1. Simple Linked Lists

2. Circular Linked Lists

3. Double Linked Lists

4. Queues 

5. Dequeues

6. Stacks