Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

C lang DS #314

Open
wants to merge 1 commit into
base: master
Choose a base branch
from
Open
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
109 changes: 109 additions & 0 deletions guides/C lang/Stacks.md
Original file line number Diff line number Diff line change
@@ -0,0 +1,109 @@
## Stacks
Stacks is an ordered list in which insertions or if we say in normal words push or elements can be added,deletion or other functions like display can be done.

* Stack follows LIFO rule that means Last In First Out in simple terms, whatever comes at the last is removed first.
* Stack mainly has three functions-pop,push and display
* Stack can be implemented by arrays,linked list(singly,doubly,circular) or even using queue
* Stack is helpful in UNDO/REDO functions in editors and alll



### A simple stack implementation using C lang

```
#include <stdio.h>
#include <stdlib.h>

struct node{
int data;
struct node *next;
}*start=NULL;

void push(int x){
struct node *p;
p=(struct node *)(malloc(sizeof(struct node)));
// t=(struct node *)(malloc(sizeof(struct node)));
p->data=x;
p->next=start;
start=p;

}




void display(){
struct node *t;
t=(struct node *)(malloc(sizeof(struct node)));
t=start;
if(t==NULL){
printf("Stack is empty");
return;
}
else{
while(t!=NULL){
printf("\t %d",t->data);
t=t->next;
}
}
}



void pop() {
if (start == NULL) {
printf("Stack is empty\n");
return ;
} else {
struct node *p = start;
int m = p->data;
start = start->next;
free(p);
printf("Popped element is %d",m);
}
}





int main() {
int choice = 0;

while (choice != 4) {
printf("\nEnter a choice\n");
printf("\n 1. POP");
printf("\n 2. PUSH");
printf("\n 3. DISPLAY");
printf("\n 4. EXIT\n");
scanf("%d", &choice);

switch (choice) {
case 1: pop();
break;
case 2:
printf("Enter an element to push\n");
int el;
scanf("%d", &el);
push(el);
break;
case 3:
display();
break;
case 4:
printf("\nExiting program");
break;
default:
printf("Enter a valid choice");
break;
}

}


return 0;
}

```

* In the above code snippet, it is a menu driven program that implements the basic functions of Stack