data
-
Implement Queue in C – Example
In the previous post, we implemented stacks, which is quite useful in real life. However, there is another data structure that we see everyday around us, which we call it a queue. In computer science, we can find its applications in simulations, print spooling, processes, and many more. Before starting to implement queue with an… Continue reading
-
Implement Stacks in C – Example
In the previous post, we implemented linked list in C. In the same way, now we are going to implement stacks in c programming language by an example. We will be using a self-referential structure which stores an integer. Let’s see the example first, It is a bit easier to implement than that of stack… Continue reading
-
Implement Linked List in C
Before starting to implement linked list in C, let’s see what self-referential structures are. Also, you need to know about dynamic memory allocation, which you can find here in this link. For example, let’s define a structure like below: In the above struct node, we have two members, viz. integer member data and pointer member… Continue reading
-
Dynamic Memory Allocation in C
Introduction In this post, we will learn about the dynamic allocation of memory in C. Also, we should be able to understand the pointers because we will be dealing with memory. To learn about pointers, please visit this link here. Dynamic Memory Allocation in C It requires dynamic memory allocation to create and maintain dynamic… Continue reading