-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathStack using Linked List in C.c
More file actions
75 lines (65 loc) · 1.27 KB
/
Copy pathStack using Linked List in C.c
File metadata and controls
75 lines (65 loc) · 1.27 KB
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
72
73
74
75
#include <stdio.h>
#include <stdlib.h>
//------Creating Node-------//
struct Node
{
int data;
struct Node* next;
};
//---------------------------//
// typedef for use shorthand notation //
typedef struct Node node;
// Creating head Pointer which is NULL//
node* top=NULL;
void push(int val)
{
node* newNode= (node*) malloc(sizeof(node));//use malloc to dynamically allocate the memory//
if(newNode==NULL)
{
printf("OVERFLOW");
return;
}
newNode->data=val;
if(top==NULL)
{
newNode->next=NULL;
}
else{
newNode->next=top;
}
top=newNode;
printf("\npushed : %d",top->data);
}
int pop()
{
node* temp=top;
if(top==NULL)
{
printf("\nUNDERFLOW");
return -1;
}
int val=top->data;
top=top->next;
free(temp);
return val;
}
int peek()
{
if(top==NULL)
return -1;
return top->data;
}
int main()
{
push(10);
push(15);
push(65);
push(5);
printf("\nPeeked :%d",peek());
printf("\nPoped :%d\n",pop());
printf("\nPoped :%d\n",pop());
printf("\nPoped :%d\n",pop());
printf("\nPoped :%d\n",pop());
printf("\n%d\n",pop());
return 0;
}