Heap

Reading Time: 3 minutes Description Heap is a tree-based data structure with some special attributes embedded into it.  Heap Data Structure has such characteristics; It is a form of Complete Binary Tree, It has a root node and its key is compared to the children nodes and the comparison is constantly carried out whenever a new node is aimed

Linked List

Reading Time: 3 minutes Definition Linked List a linear data structure like Arrays, but its internal is completely different compared to other data structures. Let’s first have a visual look how the data structure looks like As you can see in the above image Linked List maintains a list of objects linked to them, as also the name suggests

Queue

Reading Time: 2 minutes Definition Queue is a linear data structure that maintains FIFO setting; First In First Out. Queue comes in two possible internal implementations; Singly Linked List or Array. When think of FIFO, we can assume a group of people waiting queued up for buying a cinema ticket. The first person in the queue gets to buy

Stack

Reading Time: 2 minutes Definition Stack is a very usable data structure that brings the LIFO setting into the game. Let’s elaborate LIFO; LIFO is the abbreviation of Last-In-First-Out. What does LIFO really mean for us? The intentions may vary and one of them is to have a pile of things stacked down to the bottom and take one

Binary Tree

Reading Time: 6 minutes Definition Binary tree is a non-linear data structure that is composed of two nodes at most. This is how the name “Binary” is formed. However, it is not necessary for the Child Nodes that they have to have two nodes, in fact they can have even zero, we will observe such types in the following chapters.