Scribd
Upload
3 views39 pages

6 Stack

A stack is a linear data structure where additions and deletions occur at one end, known as the top, following a Last In First Out (LIFO) principle. The document outlines basic stack operations including Push, Pop, and Stack Top, as well as implementations using linked lists. It also discusses the stack Abstract Data Type (ADT) and its application interface.

Uploaded by

fapeli4129
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
3 views39 pages

6 Stack

A stack is a linear data structure where additions and deletions occur at one end, known as the top, following a Last In First Out (LIFO) principle. The document outlines basic stack operations including Push, Pop, and Stack Top, as well as implementations using linked lists. It also discusses the stack Abstract Data Type (ADT) and its application interface.

Uploaded by

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

Stack

1
Stack
 A stack is linear list in which all additions and deletions are restricted to
one end, called top

 If you insert a data series into a stack and then remove it, the order of
the data will be reverse. i.e. data input as {5,10,15,20} is removed as
{20,15,10,5}

 For this reversing attribute stack is called LIFO- Last in First out

Data Structures: A Pseudocode


2
Approach with C
Stack

Data Structures: A Pseudocode


3
Approach with C
Basic Stack Operations

The stack concept is introduced and three basic stack operations are discussed.

• Push
• Pop
• Stack Top

Data Structures: A Pseudocode


4
Approach with C
Push Operation

Data Structures: A Pseudocode


5
Approach with C
POP Operation

Data Structures: A Pseudocode


6
Approach with C
Stack Top Operation

Data Structures: A Pseudocode


7
Approach with C
Stack Example

Data Structures: A Pseudocode


8
Approach with C
Stack Linked List Implementation

Data Structures: A Pseudocode


9
Approach with C
Stack Linked List Implementation

Data Structures: A Pseudocode


10
Approach with C
Data Structures: A Pseudocode
11
Approach with C
Data Structures: A Pseudocode
12
Approach with C
Data Structures: A Pseudocode
13
Approach with C
Data Structures: A Pseudocode
14
Approach with C
Data Structures: A Pseudocode
15
Approach with C
Data Structures: A Pseudocode
16
Approach with C
Data Structures: A Pseudocode
17
Approach with C
Data Structures: A Pseudocode
18
Approach with C
Data Structures: A Pseudocode
19
Approach with C
Data Structures: A Pseudocode
20
Approach with C
Data Structures: A Pseudocode
21
Approach with C
Data Structures: A Pseudocode
22
Approach with C
Data Structures: A Pseudocode
23
Approach with C
Data Structures: A Pseudocode
24
Approach with C
Data Structures: A Pseudocode
25
Approach with C
Data Structures: A Pseudocode
26
Approach with C
Data Structures: A Pseudocode
27
Approach with C
Data Structures: A Pseudocode
28
Approach with C
3-4 Stack ADT

We begin the discussion of the stack ADT with a


discussion of the stack structure and its application
interface. We then develop the required functions.

• Data Structure
• ADT Implemenation

Data Structures: A Pseudocode


29
Approach with C
Data Structures: A Pseudocode
30
Approach with C
Data Structures: A Pseudocode
31
Approach with C
Data Structures: A Pseudocode
32
Approach with C
Data Structures: A Pseudocode
33
Approach with C
Data Structures: A Pseudocode
34
Approach with C
Data Structures: A Pseudocode
35
Approach with C
Data Structures: A Pseudocode
36
Approach with C
Data Structures: A Pseudocode
37
Approach with C
Data Structures: A Pseudocode
38
Approach with C
Data Structures: A Pseudocode
39
Approach with C

You might also like