STACK USING POINTER by smd

-
#include <stdio.h>
#include <stdlib.h>
struct node
{
    int data;
    struct node *next;
}*newn,*top=0;

void push()
{
    int x;
    printf("enter x value\n");
    scanf("%d",&x);
    newn=(struct node*)malloc(sizeof(struct node));
    newn->data=x;
    newn->next=top;
    top=newn;
}
void pop()
{
    if(top==0)
    {
        printf("stack is underflow\n");
       
    }
else
{
    struct node *temp;
    temp=top;
    printf("%d is deleted\n",temp->data);
    top=top->next;
    free(temp);
}
}
void peek()
{
    if(top==0)
    {
        printf("stack is empty\n");
       
    }
else
{
    struct node *temp;
    temp=top;
    printf("%d is top most element\n",top->data);
}
}
void display()
{
    if(top==0)
    {
        printf("stack is empty\n");
    }
else
{
    struct node *temp;
    temp=top;
    while(temp!=0)
    {
        printf("%d->",temp->data);
        temp=temp->next;
    }
}
}
void push();
void pop();
void peek();
void display();
void main()
{
    int choice=0;
    while(choice!=5)
    {
        printf("choose the below options\n");
        printf("1.push\n 2.pop\n 3.peek\n 4,display\n 5.exit\n");
        scanf("%d",&choice);
        switch(choice)
        {
            case 1:
             push();
             break;
             case 2:
             pop();
             break;
             case 3:
             peek();
             break;
             case 4:
             display();
             break;
             case 5:
             printf("exiting....");
              break;
              default :
              printf("invalid entry\n");
               break;
        }
    }
}

















OUTPUT :

choose the below options 1.push 2.pop 3.peek 4,display 5.exit 1 enter x value 10 choose the below options 1.push 2.pop 3.peek 4,display 5.exit 1 enter x value 20 choose the below options 1.push 2.pop 3.peek 4,display 5.exit 1 enter x value 30 choose the below options 1.push 2.pop 3.peek 4,display 5.exit 3 30 is top most element choose the below options 1.push 2.pop 3.peek 4,display 5.exit 2 30 is deleted choose the below options 1.push 2.pop 3.peek 4,display 5.exit 4 20->10->choose the below options 1.push 2.pop 3.peek 4,display 5.exit 5 exiting....








Comments

Post a Comment

Popular posts from this blog

SINGLE LINKED LIST by smd

-
  #include <stdio.h> #include <stdlib.h> int count = 0 ; struct node {     int data ;     struct node * next ; }   * head = NULL , * newnode , * trav ; void create_list () {     int value ;     struct node * temp ;     newnode = ( struct node * ) malloc ( sizeof ( struct node ));     printf ( "Enter the value to be inserted: " );     scanf ( " %d " , & value );     newnode -> data = value ;     newnode -> next = NULL ;     if ( head == NULL ) {         head = newnode ;     } else {         temp = head ;         while ( temp -> next != NULL )             temp = temp -> next ;         temp -> next = newnode ;     }     count ++ ; } void insert_at_begin () {     i...
Read more

CLL by smd

-
#include <stdio.h> #include <stdlib.h> int count = 0; struct node {  int data; struct node *next; }; struct node *head = NULL, *newnode, *temp; void create_circle_linked_list(); void insert_at_begin(); void insert_at_end(); void insert_at_specific_point(); void delete_at_begin(); void delete_at_end(); void delete_at_specific_point(); void display(); void create_circle_linked_list()  {  int value; printf("Enter the value to be inserted: "); scanf("%d", &value); newnode = (struct node*)malloc(sizeof(struct node)); newnode->data = value; if (head == NULL)  {  head = newnode;  newnode->next = head;  } else  {  temp = head;  while (temp->next != head) temp = temp->next; temp->next = newnode; newnode->next = head;     }     count++; } void insert_at_begin()  { int value;  printf("Enter the value to be inserted: "); scanf("%d", &value); newnode = (struct node*)malloc(sizeof(str...
Read more

QUEUE USING ARRAYS by smd

-
 #include<stdio.h> #define size 100 int queue[size]; int front = -1, rear = -1; void enqueue(int x)  {     if (rear == size - 1)      {         printf("Queue is overflow\n");     } else      {         if (front == -1)          {             front = 0; // Initialize front if queue was empty         }         rear++;         queue[rear] = x;         printf("%d inserted sucessfully\n", x);     } } void dequeue()  {     if (front == -1 || front > rear)      {         printf("Queue is underflow\n");     } else      {         printf("%d deleted successfully\n", queue[front]);         front++;         if (front ...
Read more