Illustrat the following code using diagrams to show the implementation of the stack: #include #include #include struct node{ char data[100]; struct node* next; }; int elements = 0; // function for add values to stack struct node* add(struct node* stack, char *str){ struct node* tp = (struct node*)malloc(sizeof(struct node)) ; strcpy(tp->data,str); tp->next = stack; elements++; return tp; } //redo function void redo(){ elements++; } //undo function void undo(){ elements--; } //print function int print(struct node* stack,int idx){ if(stack == NULL) return 0; idx = print(stack->next,idx); if(idxdata); return idx+1; } //function for save in file int save_command(FILE* filePointer, struct node* stack,int idx) { if(stack == NULL){ return 0; } idx = save_command(filePointer, stack->next,idx); if(idxdata); return idx+1; } //main function int main(){ //stacks for undo and redo struct node *stack1 = NULL; char input[100]; while(1==1){ printf("MyCommand > "); gets(input); if(strcmp("undo",input)==0){ //if input is undo undo(); printf("result >\n"); print(stack1,elements); } else if(strcmp("redo",input)==0){ //if input is redo redo(); printf("result >\n"); print(stack1,elements); } else if(strcmp("print",input)==0){ //if input is print printf("result >\n"); print(stack1,elements); } else if(strcmp("save", input)==0){ //if input is save FILE* filePointer; filePointer=fopen("output.txt","w"); save_command(filePointer,stack1,elements); fclose(filePointer); } else if(strcmp("quit",input)==0) //if input is quit { FILE* filePointer; filePointer=fopen("output.txt","w"); save_command(filePointer,stack1,elements); fclose(filePointer); printf("result > Good Bye!\n"); exit(0); } else //if input is any other string add to stack stack1 = add(stack1,input); } return 0; }
Illustrat the following code using diagrams to show the implementation of the stack:
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
struct node{
char data[100];
struct node* next;
};
int elements = 0;
// function for add values to stack
struct node* add(struct node* stack, char *str){
struct node* tp = (struct node*)malloc(sizeof(struct node)) ;
strcpy(tp->data,str);
tp->next = stack;
elements++;
return tp;
}
//redo function
void redo(){
elements++;
}
//undo function
void undo(){
elements--;
}
//print function
int print(struct node* stack,int idx){
if(stack == NULL)
return 0;
idx = print(stack->next,idx);
if(idx<elements)
printf("%s\n",stack->data);
return idx+1;
}
//function for save in file
int save_command(FILE* filePointer, struct node* stack,int idx)
{
if(stack == NULL){
return 0;
}
idx = save_command(filePointer, stack->next,idx);
if(idx<elements)
fprintf(filePointer,"%s\n",stack->data);
return idx+1;
}
//main function
int main(){
//stacks for undo and redo
struct node *stack1 = NULL;
char input[100];
while(1==1){
printf("MyCommand > ");
gets(input);
if(strcmp("undo",input)==0){ //if input is undo
undo();
printf("result >\n"); print(stack1,elements);
}
else if(strcmp("redo",input)==0){ //if input is redo
redo();
printf("result >\n"); print(stack1,elements);
}
else if(strcmp("print",input)==0){ //if input is print
printf("result >\n");
print(stack1,elements);
}
else if(strcmp("save", input)==0){ //if input is save
FILE* filePointer;
filePointer=fopen("output.txt","w");
save_command(filePointer,stack1,elements);
fclose(filePointer);
}
else if(strcmp("quit",input)==0) //if input is quit
{
FILE* filePointer;
filePointer=fopen("output.txt","w");
save_command(filePointer,stack1,elements);
fclose(filePointer);
printf("result > Good Bye!\n");
exit(0);
}
else //if input is any other string add to stack
stack1 = add(stack1,input);
}
return 0;
}
![](/static/compass_v2/shared-icons/check-mark.png)
Step by step
Solved in 4 steps with 2 images
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
![Computer Networking: A Top-Down Approach (7th Edi…](https://www.bartleby.com/isbn_cover_images/9780133594140/9780133594140_smallCoverImage.gif)
![Computer Organization and Design MIPS Edition, Fi…](https://www.bartleby.com/isbn_cover_images/9780124077263/9780124077263_smallCoverImage.gif)
![Network+ Guide to Networks (MindTap Course List)](https://www.bartleby.com/isbn_cover_images/9781337569330/9781337569330_smallCoverImage.gif)
![Computer Networking: A Top-Down Approach (7th Edi…](https://www.bartleby.com/isbn_cover_images/9780133594140/9780133594140_smallCoverImage.gif)
![Computer Organization and Design MIPS Edition, Fi…](https://www.bartleby.com/isbn_cover_images/9780124077263/9780124077263_smallCoverImage.gif)
![Network+ Guide to Networks (MindTap Course List)](https://www.bartleby.com/isbn_cover_images/9781337569330/9781337569330_smallCoverImage.gif)
![Concepts of Database Management](https://www.bartleby.com/isbn_cover_images/9781337093422/9781337093422_smallCoverImage.gif)
![Prelude to Programming](https://www.bartleby.com/isbn_cover_images/9780133750423/9780133750423_smallCoverImage.jpg)
![Sc Business Data Communications and Networking, T…](https://www.bartleby.com/isbn_cover_images/9781119368830/9781119368830_smallCoverImage.gif)