C_try/StackLL.c at main · idkcode1/C_try · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
#include <stdio.h>
#include <stdlib.h>

typedef struct node
{
	int data;
	struct node* next;
}node;
node *top=NULL;

void push(int val)
{
	node *newnode;
	newnode=(node*)malloc(sizeof(node));
	printf("\n%d is pushed to stack\n",val);
	newnode->data=val;
	newnode->next=top;
	top=newnode;
}

void pop()
{
	node *temp;
	temp=top;
	if(top==NULL)
		printf("\nStack Underflow\n");
	else
	{ printf("\n%d is popped from stack\n",temp->data);
	  top=top->next;
	  free(temp);
	}
}

void display()
{
	node *temp;
	temp=top;
	if(top==NULL)
		printf("\nStack Empty\n");
	else
	{ printf("\nElements in stack\n");
		while(temp!=NULL)
		{ printf("%d\n",temp->data);
		  temp=temp->next;
		}
	}
}
void peek()
{
	node *temp;
	temp=top;
	if(top==NULL)
		printf("\nEmpty!\n");
	else
	{
		printf("\nTop Element in stack -> %d\n",temp->data);
	}
}

int main()
{
	push(2);
	push(3);
	display();
	peek();
	pop();
	peek();
	pop();
	peek();
	return 0;
}