In this article, you will learn-

- 1 Rabin-Karp Algorithm
- 2 Backtracking Algorithm
- 3 Longest Common Subsequence
- 4 Floyd-Warshall Algorithm
- 5 Dynamic Programming
- 6 Huffman Coding
- 7 Prim’s Algorithm
- 8 Kruskal’s Algorithm
- 9 Dijkstra’s Algorithm
- 10 Ford-Fulkerson Algorithm
- 11 Greedy Algorithm
- 12 Binary Search
- 13 Linear Search
- 14 Shell Sort Algorithm
- 15 Heap Sort Algorithm
- 16 Bucket Sort Algorithm
- 17 Radix Sort Algorithm
- 18 Counting Sort Algorithm
- 19 Quicksort Algorithm
- 20 Merge Sort Algorithm
- 21 Insertion Sort Algorithm
- 22 Selection Sort Algorithm
- 23 Bubble Sort Algorithm
- 24 Bellman-Ford Algorithm
- 25 Breadth-first search
- 26 Depth First Search (DFS)
- 27 Adjacency List
- 28 Adjacency Matrix
- 29 Strongly Connected Components
- 30 Spanning Tree and Minimum Spanning Tree
- 31 Graph Data Structure
- 32 Red-Black Tree Deletion
- 33 Red-Black Tree Insertion
- 34 Red-Black Tree
- 35 B+ Tree Deletion
- 36 B+ Tree Insertion
- 37 B+ Tree
- 38 B-tree Deletion
- 39 B-tree Insertion
- 40 B-tree
- 41 AVL Tree
- 42 Binary Search Tree (BST)
- 43 Balanced Binary Tree
- 44 Complete Binary Tree
- 45 Perfect Binary Tree
- 46 Full Binary Tree
- 47 Binary Tree
- 48 Tree Traversal – inorder, preorder and postorder
- 49 Tree Data Structure
- 50 Decrease Key and Delete Node Operations on a Fibonacci Heap
- 51 Fibonacci Heap
- 52 Heap Data Structure
- 53 Hash Table
- 54 Types of Linked List – Singly-linked, doubly linked, and circular
- 55 Linked List Operations: Traverse, Insert and Delete
- 56 LinkedList Data Structure
- 57 Deque Data Structure
- 58 Priority Queue
- 59 Circular Queue Data Structure
- 60 Types of Queues
- 61 Queue Data Structure
- 62 Stack Data Structure
- 63 Divide and Conquer Algorithm
- 64 Master Theorem
- 65 Asymptotic Analysis: Big-O Notation and More
- 66 Why Learn Data Structures and Algorithms?
- 67 What is an Algorithm?

#### Rabin-Karp Algorithm

In this tutorial, you will learn what the rabin-karp algorithm is. Additionally, you will discover working instances of the rabin-karp ...

#### Backtracking Algorithm

In this tutorial, you will learn what a backtracking algorithm is. Likewise, you will discover an illustration of a backtracking ...

#### Longest Common Subsequence

In this tutorial, you will learn how the longest common subsequence is found. Additionally, you will discover working instances of ...

#### Floyd-Warshall Algorithm

In this tutorial, you will learn how the floyd-warshall algorithm works. Additionally, you will discover working instances of the Floyd-warshall ...

#### Dynamic Programming

In this tutorial, you will learn what dynamic programming is. Likewise, you will discover the comparison between dynamic programming and ...

#### Huffman Coding

In this tutorial, you will learn how Huffman Coding works. Additionally, you will discover working instances of Huffman Coding in ...

#### Prim’s Algorithm

In this tutorial, you will learn Prim's Algorithm works. Additionally, you will discover working instances of Prim's Algorithm in C, ...

#### Kruskal’s Algorithm

In this tutorial, you will learn how Kruskal's Algorithm works. Likewise, you will discover working instances of Kruskal's Algorithm in ...

#### Dijkstra’s Algorithm

Dijkstra's algorithm allows us to find the briefest way between any two vertices of a graph. It differs from the ...

#### Ford-Fulkerson Algorithm

In this tutorial, you will learn what the Ford-Fulkerson algorithm is. Likewise, you will discover working instances of discovering maximum ...

#### Greedy Algorithm

In this tutorial, you will learn what a Greedy Algorithm is. Additionally, you will discover an illustration of a greedy ...

#### Binary Search

In this tutorial, you will learn how the Binary Search sort works. Likewise, you will discover working instances of Binary ...

#### Linear Search

In this tutorial, you will learn about the linear search. Likewise, you will discover working instances of linearsearch C, C++, ...

#### Shell Sort Algorithm

In this tutorial, you will learn how shell sort works. Likewise, you will discover working instances of shell sort in ...

#### Heap Sort Algorithm

In this tutorial, you will learn how the heap sort algorithm works. Additionally, you will discover working instances of heap ...

#### Bucket Sort Algorithm

In this tutorial, you will learn how bucket sort works. Likewise, you will discover working instances of bucket sort in ...

#### Radix Sort Algorithm

In this tutorial, you will learn how radix sort works. Additionally, you will discover working instances of radix sort in ...

#### Counting Sort Algorithm

In this tutorial, you will learn how count sort works. Additionally, you will discover working instances of counting sort in ...

#### Quicksort Algorithm

In this tutorial, you will learn how quicksort works. Additionally, you will discover working instances of quicksort in C, C++ ...

#### Merge Sort Algorithm

In this tutorial, you will learn about merge sort. Likewise, you will discover working instances of merge sort C, C++, ...

#### Insertion Sort Algorithm

In this tutorial, you will learn how insertion sort functions. Likewise, you will discover working instances of insertions sort in ...

#### Selection Sort Algorithm

In this tutorial, you will learn how selection sort works. Additionally, you will discover working instances of selection sort in ...

#### Bubble Sort Algorithm

In this tutorial, you will learn how bubble sort works. Additionally, you will discover working instances of bubble sort in ...

#### Bellman-Ford Algorithm

The bellman-Ford algorithm helps us locate the briefest way from a vertex to any remaining vertices of a weighted graph ...

#### Breadth-first search

In this tutorial, you will learn about the breadth-first search algorithm. Additionally, you will discover working instances of bfs algorithm ...

#### Depth First Search (DFS)

In this tutorial, you will learn about depth-first search algorithms with examples and pseudocode. Additionally, you will learn how to ...

#### Adjacency List

In this tutorial, you will learn what an adjacency list is. Additionally, you will discover working instances of adjacency list ...

#### Adjacency Matrix

In this tutorial, you will learn what an adjacency matrix is. Likewise, you will discover working instances of adjacency matrix ...

#### Strongly Connected Components

In this tutorial, you will learn how strongly connected components are formed. Additionally, you will discover working instances of kosararju's ...

#### Spanning Tree and Minimum Spanning Tree

Spanning Tree: In this tutorial, you will learn about spanning trees and minimum spanning trees with the assistance of examples ...

#### Graph Data Structure

In this tutorial, you will learn what a Graph Data Structure is. Likewise, you will discover representations of a graph ...

#### Red-Black Tree Deletion

Red-Black Tree Deletion In this tutorial, you will learn how a node is deleted from a red-black tree is. Likewise, ...

#### Red-Black Tree Insertion

Red-Black Tree Insertion In this tutorial, you will learn how a new node can be inserted into a red-black tree ...

#### Red-Black Tree

In this tutorial, you will learn what a red-black tree is. Likewise, you will discover working instances of different tasks ...

#### B+ Tree Deletion

B+ Tree Deletion In this tutorial, you will learn about the deletion operation on a B+ tree. Likewise, you will ...

#### B+ Tree Insertion

B+ Tree Insertion In this tutorial, you will learn about the insertion operation on a B+ tree. Additionally, you will ...

#### B-tree Deletion

B-tree Deletion: In this tutorial, you will learn how to delete a key from a b-tree. Additionally, you will discover ...

#### B-tree Insertion

B-tree insertion In this tutorial, you will learn how to insert a key into a btree. Additionally, you will discover ...

#### Binary Search Tree (BST)

In this tutorial, you learn how Binary Search Tree functions. Additionally, you will discover working instances of Binary Search Tree ...

#### Balanced Binary Tree

In this tutorial, you will learn about a balanced binary tree and its various sorts. Likewise, you will discover working ...

#### Complete Binary Tree

In this tutorial, you will learn about a complete binary tree and its various sorts. Additionally, you will discover working ...

#### Perfect Binary Tree

In this tutorial, you will learn about the perfect binary tree. Additionally, you will discover working examples for checking a ...

#### Full Binary Tree

In this tutorial, you will learn about the full binary tree and its various theorems. Likewise, you will discover working ...

#### Binary Tree

In this tutorial, you will learn about binary tree and their various types. Likewise, you will discover working instances of ...

#### Tree Traversal – inorder, preorder and postorder

In this tutorial, you will learn about various tree traversal methods. Likewise, you will discover working instances of various tree ...

#### Tree Data Structure

In this tutorial, you will learn about tree data structure. Additionally, you will learn about various types of trees and ...

#### Decrease Key and Delete Node Operations on a Fibonacci Heap

How to decrease the key and delete the node In this tutorial, you will learn how to decrease key and ...

#### Fibonacci Heap

In this tutorial, you will learn what a Fibonacci Heap is. Likewise, you will discover working instances of various operations ...

#### Heap Data Structure

In this tutorial, you will learn what heap data structure is. Likewise, you will discover working instances of the heap ...

#### Hash Table

In this tutorial, you will learn what a hash table is. Additionally, you will discover working examples of hash table ...

#### Types of Linked List – Singly-linked, doubly linked, and circular

In this tutorial, you will learn various types of the linked list. Additionally, you will discover the implementation of a ...

#### Linked List Operations: Traverse, Insert and Delete

In this tutorial, you will learn various operations on a linked list. Additionally, you will discover the implementation of linked ...

#### LinkedList Data Structure

In this tutorial, you will learn about linked list data structure and its implementation in Python, Java, C, and C++ ...

#### Deque Data Structure

In this tutorial, you will learn what a double-ended queue (deque) is. Likewise, you will discover working instances of various ...

#### Priority Queue

In this tutorial, you will learn what a priority queue is. Likewise, you will learn about its implementations in Python, ...

#### Circular Queue Data Structure

In this tutorial, you will learn what a circular queue is. Additionally, you will discover the implementation of the circular ...

#### Types of Queues

In this tutorial, you will learn various types of queues along with illustrations. What is a queue? A Queue is ...

#### Queue Data Structure

In this tutorial, you will learn what a queue is. Additionally, you will discover the implementation of the queue in ...

#### Stack Data Structure

In this tutorial, you learn about the stack data structure and its implementation in Python, Java, and C/C++. What is ...

#### Divide and Conquer Algorithm

In this tutorial, you will learn how the divide and conquer algorithm functions. We will likewise compare the divide and ...

#### Master Theorem

In this tutorial, you will learn what master theorem is and how it is used for solving recurrence relations. What ...

#### Asymptotic Analysis: Big-O Notation and More

In this tutorial, you will learn what asymptotic notations are. Likewise, you will learn Big-O notation, Theta notation, and Omega ...

#### Why Learn Data Structures and Algorithms?

In this tutorial, we will learn why every programmer should learn data structures and algorithms with the assistance of examples ...

#### What is an Algorithm?

Introduction to Data Structure and Algorithms In this tutorial, we will learn about Data Structures and Algorithms. Data Structures are ...