DSA Tutorials

If you are new in the programming world and want to learn Data Structures and Algorithms from basic to advanced topics with a step-by-step explanation then you are in the right place.

all you need is to just follow these tutorials to learn Data Structures and algorithms.

Basic Algorithms

  1. What is Algorithm
  2. What are Data Structures and algorithms?
  3. Algorithm design and analysis
  4. Classification of algorithms
  5. Evaluating and Expressing an algorithm
  6. How to calculate the running time of an algorithm.
  7. Worst Average and Best-case analysis of the algorithm.
  8. Big o notation
  9. Big o notation examples
  10. Complexity of algorithm

Array

  1. Arrays in Data Structure
  2. Matrix in programming

Sorting Techniques

  1. Sorting Techniques in data structure
  2. Selection sorting in c programming
  3. Bubble sorting in c programming
  4. Insertion sorting in c programming
  5. Shell sorting in c programming
  6. Merge sorting in c programming
  7. Radix sorting in c programming
  8. Quick sorting in c programming
  9. Heap sorting in c programming

Linked List

  1. Linked List in Data Structure
  2. Traversing in Linked list
  3. Operations on the linked list
  4. Insertion in the linked list
  5. Deletion in a linked list
  6. Reversing a linked list
  7. Sorting a linked list
  8. Find and remove the loop in the linked list

Doubly Linked List

  1. Doubly linked list
  2. Insertion in the doubly linked list
  3. Deletion in the doubly linked list
  4. Reversing a doubly linked list

Circular Linked list

  1. Circular linked list
  2. Insertion in the circular linked list
  3. Deletion in the circular linked list

Other types of linked list

  1. Merge two linked list
  2. Header linked list
  3. Sorted linked list

Stack

  1. Stack in data structure

Queue

  1. Queue in data structure
  2. Circular Queue in Data Structure
  3. Dequeue in the data structure
  4. Priority Queue in Data Structure
  5. Polish notation

Tree

Binary Tree

  1. Binary tree
  2. Array representation of the binary tree
  3. linked representation of a binary tree
  4. Traversing in the binary tree
  5. Inorder traversal in the binary tree
  6. Preorder traversal in the binary tree
  7. Postorder traversal in the binary tree
  8. Level order traversal in the binary tree

Binary Search tree

  1. Binary search tree
  2. Insertion in the binary search tree
  3. Deletion in the binary search tree

Heap

  1. Heap in data structures

More tutorials and links will be added from time to time. this approach is followed to prepare you for product-based and service-based companies.