Arrays! the simplest and most common data structure. On this post, we are going to explore how to build an array, that is dynamically stored in the Heap with dynamic size, commonly called “vector” in C++ STL, or “ArrayList” in Java Oracle API . Our array will be internally able to increase and decrease its size, it will store any type of data using templates with overridden methods from a pure virtual class (interface), and finally, it will implement the concept of circular array and other C++11 features.

To begin, let’s define what an array is. An array is simply…

Do you know what is a binary search tree and the concept of set in mathematics? In this article we are going to build a binary tree with a set properties, self balanced (AVL) and it will be able to carry any data type (from built-in to your own objects) using the super feature in C++ templates.

Trees can be complex data structures, most of functions that can be performed on trees require recursive calls. This exercise will help us to train our brain to think recursively, understand how a binary tree class is built, how an AVL tree is…

Linked-list is a linear data structure. Unlike lists or arrays, linked-list are stored in a not continuous location in the memory, in other words, a Linked-list is sequence of elements also called nodes, that contain the data and each node a link with the next node, and it is defined as a collection of nodes which are linked together and represents a list.

Nodes are elements that carry data and have a connection to another node, this connection is often called pointer next. For the purposes of usage, our linked-list have nodes that can carry any built-in, derived or user-made…