Scribd
Upload
43 views3 pages

Lecture 3 Data Structure

Stacks are an ordered collection of data items that can only be accessed at the top of the stack. Items are added and removed based on the LIFO (last in, first out) principle, with the last item added being the first item removed. Stacks have push and pop operations for adding and removing items from the top of the stack.

Uploaded by

Sello Hlabeli
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
43 views3 pages

Lecture 3 Data Structure

Stacks are an ordered collection of data items that can only be accessed at the top of the stack. Items are added and removed based on the LIFO (last in, first out) principle, with the last item added being the first item removed. Stacks have push and pop operations for adding and removing items from the top of the stack.

Uploaded by

Sello Hlabeli
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 3

Chapter 3

Stack
Prepared by :
Hani
Introduction to Stacks
An ordered collection of data items that can
be accessed at the top of the stack.

You might also like