ABSTRACT DATA STRUCTURES | DATA STRUCTURES
|
|
IN THIS SECTION
SECTION 1 | ONE VS TWO DIMENSIONAL ARRAYS SECTION 2 | CONSTRUCTING A 2D ARRAY ALGORITHM SECTION 3 | WHAT ARE STACKS AND QUEUES SECTION 4 | STACKS SECTION 5 | QUEUES SECTION 6 | MEMORY ALLOCATION SECTION 7 | DYNAMIC MEMORY SECTION 8 | HEAP MEMORY SECTION 9 | STACK OVERFLOW |
ALSO IN THIS TOPIC
RECURSION YOU ARE HERE | DATA STRUCTURES LINKED LISTS TREES APPLICATION TOPIC 5 REVISION KEY TERMINOLOGY TOPIC 5 ANSWERS |
|
|
With a LIFO stack the last item of data in to the stack is always the first item of data out. To illustrate this, imagine piling books on top of each other, the last book you placed(at the top of the pile) is the first book you will pick up, even if you want to read the book from the bottom of the pile you would need to remove (pop) each book above it first. This is known as Last In First Out (LIFO)
|
SUGGESTIONS
We would love to hear from you |
SUBSCRIBE
To enjoy more benefits |