Data Struct

Course
Free
INTRODUCTION
  1. Data structures introduction
  2. Abstract data types
  3. Introduction to Big-O
  4. Dynamic and Static Arrays
  5. Dynamic Array Code
  6. Linked Lists Introduction
  7. Doubly Linked List Code
  8. Stack Introduction
  9. Stack Implementation
  10. Stack Code
  11. Queue Introduction
  12. Queue Implementation
  13. Queue Code
  14. Priority Queue Introduction
  15. Priority Queue Min Heaps and Max Heaps
  16. Priority Queue Inserting Elements
  17. Priority Queue Removing Elements
  18. Priority Queue Code
  19. Union Find Introduction
  20. Union Find Kruskal\'s Algorithm
  21. Union Find - Union and Find Operations
  22. Union Find Path Compression
  23. Union Find Code
  24. Binary Search Tree Introduction
  25. Binary Search Tree Insertion
  26. Binary Search Tree Removal
  27. Binary Search Tree Traversals
  28. Binary Search Tree Code
  29. Hash table hash function
  30. Hash table separate chaining
  31. Hash table separate chaining source code
  32. Hash table open addressing
  33. Hash table linear probing
  34. Hash table quadratic probing
  35. Hash table double hashing
  36. Hash table open addressing removing
  37. Hash table open addressing code
  38. Fenwick Tree range queries
  39. Fenwick Tree point updates
  40. Fenwick Tree construction
  41. Fenwick tree source code
  42. Suffix array introduction
  43. Longest Common Prefix (LCP) array
  44. Suffix array finding unique substrings
  45. Longest common substring problem suffix array
  46. Longest common substring problem suffix array part 2
  47. Longest Repeated Substring suffix array
  48. Balanced binary search tree rotations
  49. AVL tree insertion
  50. AVL tree removals