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.

Sign up for GitHub

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

Jump to bottom

Update stack_using_linked_lists.c #620

Open
wants to merge 9 commits into
base: master
Choose a base branch
from
Open

Update stack_using_linked_lists.c #620

Changes from all commits
Commits
Show all changes
9 commits
Select commit Hold shift + click to select a range
ddf671d
Update stack_using_linked_lists.c
Shwetik Sep 30, 2020
9a70599
Update stack_using_linked_lists.c
Shwetik Sep 30, 2020
8d63bec
Update stack_using_linked_lists.c
Shwetik Sep 30, 2020
e1bbff8
Update stack_using_linked_lists.c
Shwetik Sep 30, 2020
7bb6d59
Update stack_using_linked_lists.c
Shwetik Sep 30, 2020
12044c8
Update stack_using_linked_lists.c
Shwetik Sep 30, 2020
400218f
Update data_structures/linked_list/stack_using_linked_lists.c
Shwetik Sep 30, 2020
4d8bfe2
Update data_structures/linked_list/stack_using_linked_lists.c
Shwetik Sep 30, 2020
c75e9f2
Update data_structures/linked_list/stack_using_linked_lists.c
Shwetik Sep 30, 2020
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
16 changes: 13 additions & 3 deletions data_structures/linked_list/stack_using_linked_lists.c
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -36,7 +36,12 @@ int main()
}
}

void push(struct node *p)
/**
* push function will add a new node at the head of the list, time complexity O(1)
* @param p pointer to the top of the stack
* @returns void
*/
void push(struct node *p)
{
int item;
struct node *temp;
Expand All @@ -50,7 +55,13 @@ void push(struct node *p)

printf("inserted succesfully\n");
}
void pop(struct node *p)

/**
* pop function deletes the first node from the head, time complexity O(1)
* @param p pointer to the top of the stack
* @returns void
*/
void pop(struct node *p)
{
int item;
struct node *temp;
Expand Down Expand Up @@ -79,6 +90,5 @@ void display(struct node *p)
printf("%d\n", p->info);
p = p->link;
}
// printf("%d\n",p->info);
}
}