Skip to main content
Computer Science Fundamentals Beginner

Data Structures

The structures every technical interview and most real systems depend on — arrays, linked lists, stacks, queues, hash tables, trees, heaps, tries and graphs — each with its operations and the complexity trade-offs behind choosing it.

29 chapters 7h 15m
Start Learning

What you'll learn

  • Introduction to Data Structures
  • Time Complexity and Big O Notation
  • Arrays Fundamentals
  • Dynamic Arrays
  • Strings and Character Arrays
  • Recursion Basics
  • Linked Lists Introduction
  • Singly Linked Lists

Course content

29 chapters · 7h 15m
  1. 1 Introduction to Data Structures 15 min
  2. 2 Time Complexity and Big O Notation 15 min
  3. 3 Arrays Fundamentals 15 min
  4. 4 Dynamic Arrays 15 min
  5. 5 Strings and Character Arrays 15 min
  6. 6 Recursion Basics 15 min
  7. 7 Linked Lists Introduction 15 min
  8. 8 Singly Linked Lists 15 min
  9. 9 Doubly Linked Lists 15 min
  10. 10 Circular Linked Lists 15 min
  11. 11 Stack Data Structure 15 min
  12. 12 Queue Data Structure 15 min
  13. 13 Circular Queue 15 min
  14. 14 Deque (Double Ended Queue) 15 min
  15. 15 Priority Queue 15 min
  16. 16 Hash Tables and Hash Maps 15 min
  17. 17 Sets and Hash Sets 15 min
  18. 18 Trees Introduction 15 min
  19. 19 Binary Trees 15 min
  20. 20 Binary Search Trees (BST) 15 min
  21. 21 AVL Trees 15 min
  22. 22 Heaps and Priority Heaps 15 min
  23. 23 Graph Traversal Algorithms 15 min
  24. 24 Trie Data Structure 15 min
  25. 25 Graphs Introduction 15 min
  26. 26 Sorting Algorithms (Basics) 15 min
  27. 27 Advanced Sorting (Merge & Quick) 15 min
  28. 28 Search Algorithms (Linear & Binary) 15 min
  29. 29 Dynamic Programming 15 min