Iterator is an object used to access and iterate elements of a container (data structure) like (vectors, lists, etc). Let’s see an example of implementing doubly linked list with iterators: List A...

The simple idea of dynamic array is the ability to resize itself when inserting new elements to avoid overflow. How we can extend the array (make it grows)? Create an initial size capacity for ...

Queue is a simple data structure serves collection of elements with 2 main operations (enqueue and dequeue). The order of each element is added or removed from a stack is referred by FIFO (First In...

Stack is a simple data structure serves collection of elements with 2 main operations (push and pop). The order of each element is added or removed from a stack is referred by LIFO (Last In First O...

Singly Linked List A list of nodes in Linear form each node has data and a pointer to the next node (NULL if there’s no nodes). template <typename T> struct SNode { T elem; SNode<T> ...

First we should know about “Complete Binary Tree” as we will use later. Complete Tree Complete binary tree is a binary tree where all of its level are filled completely (perfect) except the last l...

Choosing distro It depends on your experience with Linux Beginner ? Mint : Arch If you know what you’re doing, Arch is very very stable. Arch with no systemd == Artix Wh...