mirrors/TheAlgorithms-C
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C synced 2024-11-21 21:11:57 +03:00
Code Issues Packages Projects Releases Wiki Activity

Merge pull request #768 from Suraj-Patro/patch-28

Browse Source 
fix: Improved source code formatting at data_structures/linked_list/stack_using_linked_lists.c
This commit is contained in:
Ayaan Khan 2021-02-11 10:15:51 +05:30 committed by GitHub
commit 5eee22a750
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 9 additions and 9 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

18
data_structures/linked_list/stack_using_linked_lists.c
View File

@ -16,8 +16,8 @@ int main()
printf("\t****stack using linked list****\n");
while (x != 4)
{
printf("enter your choice");
printf("\n1.push\n2.pop\n3.display\n4.exit\n");
printf("\n1. Push\n2. Pop\n3. Display\n4. Exit\n");
printf("Enter your choice: ");
scanf("%d", &x);
switch (x)
{
@ -41,14 +41,14 @@ void push(struct node *p)
int item;
struct node *temp;
temp = (struct node *)malloc(sizeof(struct node));
printf("enter element to be inserted\n");
printf("\nEnter element to be inserted: ");
scanf("%d", &item);
temp->info = item;
temp->link = top;
top = temp;
printf("inserted succesfully\n");
printf("Inserted succesfully.\n");
}
void pop(struct node *p)
{
@ -56,27 +56,27 @@ void pop(struct node *p)
struct node *temp;
if (top == NULL)
printf("stack is empty\n");
printf("\nStack is empty.\n");
else
{
item = top->info;
temp = top;
top = top->link;
free(temp);
printf("Element popped is%d\n", item);
printf("\nElement popped is %d.\n", item);
}
}
void display(struct node *p)
{
if (top == NULL)
printf("stack is empty\n");
printf("\nStack is empty.\n");
else
{
printf("Elements in the stack are\n");
printf("\nElements in the stack are:\n");
while (p != NULL)
{
printf("%d\n", p->info);
printf("\t%d\n", p->info);
p = p->link;
}
// printf("%d\n",p->info);