We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
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
Modify the https://github.com/driptanil/DSA-Data-Structures-Algorithms/blob/main/21-stacks-queues/src/com/inclass/stack/CustomStackLinkedList.c
WARNING !!! : Don't copy and paste code from the internet
Comment below if you want to be assigned to this issue (then start working on the issue)
use structure (struct) to create a linked list
struct
use dynamic memory allocation (malloc()) to initial a structure (struct)
malloc()
create a menu using an infinite switch case which implements all the functions
1. Push 2. Pop 3. Peek 4. Exit
display the linked list after all operations
push() - adds new element at the top of the stack
push()
pop() - removes the element at the top of the stack
pop()
peek() - displays the top most element in the stack
peek()
display() - prints stack
display()
The text was updated successfully, but these errors were encountered:
Sure
Sorry, something went wrong.
I have assigned you this issue, start working on it
Enjoy ! 😁
Hey! I would like to contribute in this, Please assign this to me.
Sorry I have already assigned it to @NyanCyanide, if he doesn't create a pull request in 24 hours.
I will assign this to you, try other issues
thank you
@Abhinav-J05 I have added some more issues, try contributing to those issue
@driptanil can you assign this to me now?
NyanCyanide
No branches or pull requests
Rules:
Modify the https://github.com/driptanil/DSA-Data-Structures-Algorithms/blob/main/21-stacks-queues/src/com/inclass/stack/CustomStackLinkedList.c
WARNING !!! : Don't copy and paste code from the internet
Comment below if you want to be assigned to this issue (then start working on the issue)
Fundamentals:
Use Concepts:
use structure (
struct
) to create a linked listuse dynamic memory allocation (
malloc()
) to initial a structure (struct
)create a menu using an infinite switch case which implements all the functions
display the linked list after all operations
Create functions:
push()
- adds new element at the top of the stackpop()
- removes the element at the top of the stackpeek()
- displays the top most element in the stackdisplay()
- prints stackThe text was updated successfully, but these errors were encountered: