-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path21_Repr_Arithmetic.c
More file actions
83 lines (73 loc) · 1.56 KB
/
21_Repr_Arithmetic.c
File metadata and controls
83 lines (73 loc) · 1.56 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
76
77
78
79
80
81
82
83
/*
21
Representation of arithmetic expressions using linked list
Name: Sayooj K
Roll no: 45
*/
#include <stdio.h>
#include <stdlib.h>
struct node {
char data;
struct node *next;
}*HEADER;
int deleteAll() {
struct node *ptr = HEADER, *prevPtr;
while (ptr != NULL) {
prevPtr = ptr;
ptr = ptr->next;
free(prevPtr);
}
HEADER->next = NULL;
return (0);
}
struct node *newNode() {
struct node *newptr = malloc(sizeof(struct node));
if (newptr == NULL) {
printf("Memory overflow");
deleteAll();
exit(0);
}
return (newptr);
}
int insertNodeEnd(int data) {
struct node *newptr = newNode(), *currentNode = HEADER;
while (currentNode->next != NULL) {
currentNode = currentNode->next;
}
newptr->next = currentNode->next;
newptr->data = data;
currentNode->next = newptr;
return (0);
}
int printLinkedList() {
struct node *currentNode = HEADER->next;
while (currentNode != NULL) {
printf("%c", currentNode->data);
currentNode = currentNode->next;
}
printf("\n");
return (0);
}
int main() {
char infix[100], buffer;
int i=0;
// initialize Linked List
HEADER = malloc(sizeof(struct node));
HEADER->data = 0;
HEADER->next = NULL;
// finished initializing Linked List
printf("Enter arithmatic expression : ");
scanf("%s", infix);
for (i=0; infix[i]!='\0'; i++) {
insertNodeEnd(infix[i]);
}
printf("Entered experssion : ");
printLinkedList();
deleteAll();
return (0);
}
/*
OUTPUT:
Enter arithmatic expression : (7+3)*5
Entered experssion : (7+3)*5
*/