Stack program in c using linked list

This is done in the next line of the code i. We have created a node struct node using this line of code. The next and the most important operations on a stack are push and pop. In pop operation, we delete the topmost node and returns its value. The steps for the pop operations are:. Please login to view or add comment s. Become an Author Submit your Article.

It's Simple and Conceptual. Get Python course for Days Hours Min Sec. Pro Course Features. Simple Videos. Questions to Practice. Solved Examples. Certificate of Completion. Discussion with Experts. We're Hiring. Write a program in C to implement a stack data structure using singly linked list. We will maintain only one node pointer "top", which always points to the head node of linked list. This will ensure that we will add or remove node from one end of linked list.

We will start with an empty linked list, where top pointer is set to NULL. Push Operation : We will dynamically allocate memory for a struct node variable let's say temp. Finally set top pointer to temp. Store the top pointer in a temp variable. Deallocate memory of temp node using free. Peek Operation : Returns the value of head node of linked list without removing it.