8m · 4min read

A stack is a linear data structure that follows the Last In First Out (LIFO) principle, meaning the last element added to the stack will be the first one to be removed. This concept can be likened to a stack of plates; you add a plate to the top of the stack, and when you need to remove a plate, you take it from the top as well. The last plate you add will also be the first one you remove.

9m · 7min read

Two common types of data types are primitive types and abstract data types. While primitive types are basic building blocks of a programming language, abstract data types provide a more complex structure that encapsulates data and operations

11m · 4min read

A linked list is a linear data structure where each element is a separate object. Each element (node) of a list consists of two items: the data and a reference to the next node.