Implementation of Stack with Singly Linked List : C Program

 


Here is the code for implementation of stack with singly linked list :

program code :

#include<stdio.h>

#include <stdlib.h>

struct node

{

    int data;

    struct node *next;

};


struct node *top=NULL;


void push(int d)

{

    struct node *newnode=(struct node*)malloc(sizeof(struct node));

    newnode->data=d;

    newnode->next=NULL;

    if(top==NULL)

    {

        top=newnode;

    }

    else{

        newnode->next=top;

        top=newnode;

    }

    printf("\ndata %d has been pushed (entered to stack).",d);

}


void pop()

{

    struct node *p,*temp=top;

    if(temp=NULL)

    {

        printf("\nstack is empty.");

        return;

    }

    p=top;

    top=top->next;

    free(p);

    printf("\ntop element has been poped(deleted).");

}


void display()

{

    struct node *p=top;

    if(p==NULL)

    {

        printf("\nstack is empty.");

        return;

    }

    printf("\nstack elements are : ");

    while(p!= NULL)

    {

        printf("%d ",p->data);

        p=p->next;

    }

}


int main()

{

    int el,op,exit=1;

    do

    {

        printf("\nwhat you need : 1.push   2.pop  3.display  4.exit  : ");

        scanf("%d",&op);

        switch(op)

        {

        case 1:

            printf("enter the data : ");

            scanf("%d",&el);

            push(el);

            break;

        case 2:

            pop();

            break;

        case 3:

            display();

            break;

        case 4:

            exit=0;

            break;

        default:

            printf("\n enter a valid key dude ");

        }

    }while(exit==1);

    return 0;

}

output : 


_----------_---------_-----------_/.

Happy coding. 

Comment what you need. 

Comments

Post a Comment

Popular posts from this blog

infix to postfix expression converter in "C" language

 program: #include<stdio.h> void infix_to_postfix(char[],char[]); int precedence(char); void main() { char infix[20],postfix[20]; printf("enter infix string : "); scanf("%s",infix); infix_to_postfix(infix,postfix); printf("\npostfix exp= %s",postfix); } void infix_to_postfix(char infix[],char postfix[]) { char s[20],symbol; int top=-1,i=0,j=0; while(infix[i]!='\0') { symbol=infix[i]; switch(symbol) { case '(':++top;          s[top]=symbol;          break;     case ')':while(s[top]!='(')              {               postfix[j++]=s[top];               top--; }           top--;           break;     case '+':     case '-':     case '*':     case '...
Read more

swapping first and last digits of a number :Python Program

Image
  Here is the program for swapping first and last digits of a number in Python programming language program code : n=int(input("number:")) last=n%10 n=int(n/10) n1=str(n) n2=str(1) n6=str(1) for i in range(len(n1)-1):     n2=n2+str(0)     n6=n6+str(0) n6=int(n6) n2=int(n2) n5=int(n/n6) n3=n%n2 print(n5) n4=str(last)+str(n3)+str(n5) print(int(n4)) output : enter number :284517 784512 happy coding. comment what you need.
Read more

DOUBLE LINKED LIST IMPLEMENTATION

Image
welcome to yocoding, a place where you can find what you need, if not comment what you need.   CODE :  #include<stdio.h> #include<conio.h> #include<stdlib.h> struct Node {   int data;   struct Node *prev,*next; }; struct Node *head=NULL; void insert_beg(int d) {     struct Node *p;     p= (struct Node*)malloc(sizeof(struct Node));     p->data=d;     p->prev=NULL;     if(head == NULL)     {        p->next = NULL;        head=p;     }     else     {        p->next=head;        head->prev=p;        head=p;     } } void insert_end(int d) {    struct Node *p;    p=(struct Node*)malloc(sizeof(struct Node));    p->data=d;    p->next = NULL;    if(head == NULL)    {   ...
Read more