© 2014 Firstsoft Technologies (P) Limited. login
Hi 'Guest'
Home SiteMap Contact Us Disclaimer
enggedu
Quick Links
Easy Studies

Home Lab Exercise Data Structures Lab Exercise ProgramsImplementation of Stack Using Linked list Abstract Data Type▼

Implementation of Stack Using Linked list Abstract Data Type:

Algorithm Steps:
  1. Create a linked list
  2. To PUSH a node X travel the list until the end is reached. Assign last node’s Link to X.
  3. To POP a node X delete the last node and set the previous to last node’s LINK to NULL.
  4. To display the stack contents traverse the list from the header till the last node.

C Program To Implement Stack Using Linked list Abstract Data Type:

#include #include #include #include struct node { int data; struct node*link; }; struct node*cur, *first; void create( ) void push( ) void pop( ) void display( ) void create( ) { printf(“\n ENTER THE FIRST ELEMENT :”); cur = (struct node*)malloc(sizeof (struct node)); scanf (“%d”, &cur?data); cur?link = NULL; first = cur; } void display ( ) { cur = first; printf(“\n”); while(cur!= NULL) { printf (“%d\n”, cur?data ); cur = cur ?link; } } void push( ) { printf (“\n ENTER THE NEXT ELEMENT: “); cur = ( struct node*)malloc(sizeof (struct node)); scanf (“%d”, &cur?data); cur?link = first; first = cur; } void pop( ) { if (first = = NULL) { printf(“\n STACK IS EMPTY \n”); } else { cur = first; printf (“ \n DELETED ELEMENT IS %d \n”, first?data); first = first?link; free(cur); } } void main( ) { int ch; clrscr( ); while(1) { printf (“\n\n1.CREATE \n2.PUSH\n 3.POP \n 4.EXIT \n”); printf(“\n ENTER YOUR CHOICE”); scanf (“%d”, &ch); switch(ch) { case 1: create( ) display( ) break; case 2; push( ); display( ); break; case 3: pop( ); display( ); break; case 4: exit (0); } } }

SAMPLE INPUT OUTPUT:

1.CREATE
2.PUSH
3.POP
4.EXIT

ENTER YOUR CHOICE: 1
ENTER THE FIRST ELEMENT : 10
10

1.CREATE
2.PUSH
3.POP
4.EXIT

ENTER YOUR CHOICE: 2
ENTER THE FIRST ELEMENT : 20
20
10

1.CREATE
2.PUSH
3.POP
4.EXIT

ENTER YOUR CHOICE: 2
ENTER THE FIRST ELEMENT : 30
30
20
10

1.CREATE
2.PUSH
3.POP
4.EXIT

ENTER YOUR CHOICE: 3
DELETED ELEMENT IS 30
20
10

1.CREATE
2.PUSH
3.POP
4.EXIT

ENTER YOUR CHOICE: 4
                                   
    

 
SLogix Student Projects

⇓Student Projects⇓
⇑Student Projects⇑
bottom