STACK

1 / 9

STACK - PowerPoint PPT Presentation

DATA STRUCTURE. STACK. Stack. A stack is a list of element in which an element may be inserted or deleted only at one end, called the top of the stack. This means in particular ,that elements are removed from a stack in the reverse order of thet in which they were inserted into the stack.

I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.

PowerPoint Slideshow about 'STACK' - waldo

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.

- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript
Stack
• A stack is a list of element in which an element may be inserted or deleted only at one end, called the top of the stack. This means in particular ,that elements are removed from a stack in the reverse order of thet in which they were inserted into the stack.
• Stack is also called last-in-first –out (LIFO)type of list .
Example of stack
• Stack of book
• Stack of pennies
Two basic operation
• PUSH is the term used to insert an element into a stack
• POP is the term used to delete an element from a stack
Diagram of push operation

top

top

F

E

A

B

C

D

top

E

A

B

C

D

A

B

C

D

top

Push( F)

Push (E)

Diagram of POP operation

A

B

C

D

A

B

C

A

B

top

top

top

POP( C)

POP (D)

Implementation of stack
• Static implementation of stack
• Dynamic implementation of stack
Static implementation of stack
• Static implementation of stack uses of array to create stack.
• Therefore a stack can be declared as a structure containing two fields .

Ex:

#define MAXSIZE 100

Strcut stack{int top;

int element[MAXSIZE]

};

Struct stack s;

Dynamic implementation of stack
• Dynamic implementation is also called linked list representation and uses pointer to implement the stack type of data structure
• Ex:

Strcut node{int info;

int node *next;

};

Struct node *s;