Stack Implementation Using Singly Linked List

A linked list is a linear dynamic data structure to store data items. We have already seen arrays in our previous topics on basic C++. We also know that arrays are a linear data structure that store data items in contiguous locations.

Unlike arrays, the linked list does not store data items in contiguous memory locations.

A linked list consists of items called “Nodes” which contain two parts. The first part stores the actual data and the second part has a pointer that points to the next node. This structure is usually called “Singly linked list”.