Here we are including the Data structures and algorithms tutorials for everyone who wants to learn about DSA from basic to advanced. Everyone can use these tutorials to prepare for their university exams, mock interviews, and coding interviews.

If you want any other topic that needs to be covered in Data structures and algorithms, then please send us a mail with the topic name.

DSA Tutorials

Data structures and algorithms tutorials for Beginners

  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
  11. Arrays in Data Structure
  12. Matrix in programming
  13. Sorting Techniques in data structure
  14. Selection sorting in c programming
  15. Bubble sorting in c programming
  16. Insertion sorting in c programming
  17. Shell sorting in c programming
  18. Merge sorting in c programming
  19. Radix sorting in c programming
  20. Quick sorting in c programming
  21. Heap sorting in c programming
  22. Linked List in Data Structure
  23. Traversing in Linked list
  24. Operations on the linked list
  25. Insertion in the linked list
  26. Deletion in a linked list
  27. Reversing a linked list
  28. Sorting a linked list
  29. Find and remove the loop in the linked list
  30. Doubly linked list
  31. Insertion in the doubly linked list
  32. Deletion in the doubly linked list
  33. Reversing a doubly linked list
  34. Circular linked list
  35. Insertion in the circular linked list
  36. Deletion in the circular linked list
  37. Merge two linked list
  38. Header linked list
  39. Sorted linked list
  40. Stack in data structure
  41. Queue in data structure
  42. Circular Queue in Data Structure
  43. Dequeue in the data structure
  44. Priority Queue in Data Structure
  45. Polish notation
  46. Tree in the data structure
  47. Binary tree
  48. Array representation of the binary tree
  49. linked representation of a binary tree
  50. Traversing in the binary tree
  51. Inorder traversal in the binary tree
  52. Preorder traversal in the binary tree
  53. Postorder traversal in the binary tree
  54. Level order traversal in the binary tree
  55. Binary search tree
  56. Insertion in the binary search tree
  57. Deletion in the binary search tree
  58. Heap in data structures