Data Structures are special mechanisms in computer programming which help us in storing and retrieving data in different ways. For example, if we wish to store the list of all persons invited for an event, we might use an array data structure which holds all the data sequentially. However if we need to quickly determine if a particular person is invited the event, we might use a better alternative like hash maps.
In this section, we will go through most of the basic and advanced types of data structures and look at scenarios where each type of data structure excel in. Below are all the data structures explained so far:
Array Data Structure
Imagine you have a list of things you want to keep track of, like the scores from your last five game rounds or the names of your friends. How would you store them neatly? An array is one of the simplest and most common ways computers do
Basics of Linked List Data Structure
A linked list is a fundamental data structure in computer science that can store and manage a collection of items. Unlike arrays, which use contiguous memory locations, linked lists consist of a sequence of nodes, with each node containing
Introduction to Hash Table Data Structure
Imagine searching for a specific book in a huge library containing thousands of books spread across thousands of shelves. If there are no hints on where to look, you might have to check every single shelf, which could take a very long time
Stack Data Structure
A stack is an abstract data structure which is used to store a collection of elements with the ability to add or remove elements at only one endpoint often called the top . Due to this property of a stack which restricts addition or
Queue Data Structure
Queue is an abstract data structure which can be visualized as a line of people waiting in a queue, where the first person to arrive is the first one to be served. New persons joining the queue will be served only after all persons already
Binary Tree Data Structure
A binary tree is a type of tree data structure which stores collection of items in a hierarchical format. Unlike all the other data structures we have seen so far like arrays, linked lists, stacks etc which are linear, binary trees are two
Binary Search Tree
A binary search tree is a type of binary tree data structure where every node in the binary tree confirms to the below properties:
Advanced Tree related data structures structures
This section covers some of the more complicated tree related data structures. Below are all of them:
Graph Data Structure
A graph in computer science is a data structure that represents a set of objects along with the connections or relations between them. The objects are often referred to as nodes or vertices, and the connections are called edges or arcs