Data Structure and Algorithms in Java

Data Structure and Algorithms in Java

Great Learning via YouTube Direct link

Introduction

1 of 56

1 of 56

Introduction

Class Central Classrooms beta

YouTube playlists curated by Class Central.

Classroom Contents

Data Structure and Algorithms in Java

Automatically move to the next video in the Classroom when playback concludes

  1. 1 Introduction
  2. 2 Agenda
  3. 3 Introduction to Data Structure
  4. 4 Types of Data Structure
  5. 5 Arrays Introduction
  6. 6 Arrays Implementation
  7. 7 Advantages and Disadvantages of Arrays
  8. 8 Stack introduction
  9. 9 Stack implementation
  10. 10 Advantages and Disadvantages of Stack
  11. 11 Queue introduction
  12. 12 Queue implementation
  13. 13 Advantages and Disadvantages of Queue
  14. 14 Linked list introduction
  15. 15 Linked list types
  16. 16 Linked List implementation
  17. 17 Circular Linked list implementation
  18. 18 Advantages and Disadvantages of Linked List
  19. 19 Binary tree introduction
  20. 20 Binary tree implementation
  21. 21 Advantages and Disadvantages of Binary Tree
  22. 22 Binary search tree introduction
  23. 23 Binary search tree implementation
  24. 24 Advantages and Disadvantages of Binary search Tree
  25. 25 Graphs introduction
  26. 26 Breadth first search implementation
  27. 27 Depth first search implementation
  28. 28 Hash tables introduction
  29. 29 Hashing implementation
  30. 30 Algorithms introduction and algorithmic analysis
  31. 31 Finding space and time complexity
  32. 32 Linear Search
  33. 33 Linear search implementation
  34. 34 Complexity analysis of Linear Search
  35. 35 Binary Search
  36. 36 Bnary search implementation
  37. 37 Complexity analysis of Binary Search
  38. 38 Insertion sort
  39. 39 Insertion sort implementation
  40. 40 Complexity analysis of Insertion sort
  41. 41 Selection sort
  42. 42 Selection sort implementation
  43. 43 Complexity analysis of Selection sort
  44. 44 Quick sort
  45. 45 Quick sort implementation
  46. 46 Complexity analysis of Quick sort
  47. 47 Introduction to Divide and Conquor approach
  48. 48 Merge sort
  49. 49 merge sort implementation
  50. 50 Introduction to Greedy's approach
  51. 51 Prim's minimal Spanning Tree algorithm
  52. 52 Prim's minimal Spanning Tree algorithm implementation
  53. 53 Introduction to Dynamic Programming
  54. 54 Tower of Hanoi
  55. 55 Tower of Hanoi implementation
  56. 56 Summary

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.