Data Structures - Computer Science Course for Beginners

Learn all about Data Structures in this lecture-style course. You will learn what Data Structures are, how we measure a Data Structures efficiency, and then hop into talking about 12 of the most common Data Structures which will come up throughout your Computer Science journey.

⭐️ Script, Visuals, and Sources ⭐️

⭐️ Links as They Appear ⭐️

⭐️ Course Contents ⭐️
💻 (00:00) Introduction
⌨️ (01:06) Timestamps
⌨️ (01:23) Script and Visuals
⌨️ (01:34) References + Research
⌨️ (01:56) Questions
⌨️ (02:12) Shameless Plug
⌨️ (02:51) What are Data Structures?
⌨️ (04:36) Series Overview
💻 (06:55) Measuring Efficiency with BigO Notation
⌨️ (09:45) Time Complexity Equations
⌨️ (11:13) The Meaning of BigO
⌨️ (12:42) Why BigO?
⌨️ (13:18) Quick Recap
⌨️ (14:27) Types of Time Complexity Equations
⌨️ (19:42) Final Note on Time Complexity Equations
💻 (20:21) The Array
⌨️ (20:58) Array Basics
⌨️ (22:09) Array Names
⌨️ (22:59) Parallel Arrays
⌨️ (23:59) Array Types
⌨️ (24:30) Array Size
⌨️ (25:45) Creating Arrays
⌨️ (26:11) Populate-First Arrays
⌨️ (28:09) Populate-Later Arrays
⌨️ (30:22) Numerical Indexes
⌨️ (31:57) Replacing information in an Array
⌨️ (32:42) 2-Dimensional Arrays
⌨️ (35:01) Arrays as a Data Structure
⌨️ (42:21) Pros and Cons
💻 (43:33) The ArrayList
⌨️ (44:42) Structure of the ArrayList
⌨️ (45:19) Initializing an ArrayList
⌨️ (47:34) ArrayList Functionality
⌨️ (49:30) ArrayList Methods
⌨️ (50:26) Add Method
⌨️ (53:57) Remove Method
⌨️ (55:33) Get Method
⌨️ (55:59) Set Method
⌨️ (56:57) Clear Method
⌨️ (57:30) toArray Method
⌨️ (59:00) ArrayList as a Data Structure
⌨️ (1:03:12) Comparing and Contrasting with Arrays
💻 (1:05:02) The Stack
⌨️ (1:05:06) The Different types of Data Structures
⌨️ (1:05:51) Random Access Data Structures
⌨️ (1:06:10) Sequential Access Data Structures
⌨️ (1:07:36) Stack Basics
⌨️ (1:09:01) Common Stack Methods
⌨️ (1:09:45) Push Method
⌨️ (1:10:32) Pop Method
⌨️ (1:11:46) Peek Method
⌨️ (1:12:27) Contains Method
⌨️ (1:13:23) Time Complexity Equations
⌨️ (1:15:28) Uses for Stacks
💻 (1:18:01) The Queue
⌨️ (1:18:51) Queue Basics
⌨️ (1:20:44) Common Queue Methods
⌨️ (1:21:13) Enqueue Method
⌨️ (1:22:20) Dequeue Method
⌨️ (1:23:08) Peek Method
⌨️ (1:24:15) Contains Method
⌨️ (1:25:05) Time Complexity Equations
⌨️ (1:27:05) Common Queue Uses
💻 (1:28:16) The Linked List
⌨️ (1:31:37) LinkedList Visualization
⌨️ (1:33:55) Adding and Removing Information
⌨️ (1:41:28) Time Complexity Equations
⌨️ (1:44:26) Uses for LinkedLists
💻 (1:47:19) The Doubly-LinkedList
⌨️ (1:48:44) Visualization
⌨️ (1:50:56) Adding and Removing Information
⌨️ (1:58:30) Time Complexity Equations
⌨️ (1:59:06) Uses of a Doubly-LinkedList
💻 (2:00:21) The Dictionary
⌨️ (2:01:15) Dictionary Basics
⌨️ (2:02:00) Indexing Dictionaries
⌨️ (2:02:40) Dictionary Properties
💻 (2:05:53) Hash Table Mini-Lesson
⌨️ (2:13:26) Time Complexity Equations
💻 (2:16:39) Trees
⌨️ (2:16:55) Introduction to Hierarchical Data
⌨️ (2:18:54) Formal Background on the Tree
⌨️ (2:20:03) Tree Terminology and Visualization
⌨️ (2:25:08) Different types of Trees
⌨️ (2:28:07) Uses for the Tree
💻 (2:29:00) Tries
⌨️ (2:29:50) Trie Basics
⌨️ (2:30:41) Trie Visualization
⌨️ (2:34:33) Flagging
⌨️ (2:35:15) Uses for Tries
💻 (2:38:25) Heaps
⌨️ (2:38:51) Heap Basics
⌨️ (2:39:19) Min-Heaps
⌨️ (2:40:07) Max-Heaps
⌨️ (2:40:59) Building Heaps
⌨️ (2:44:20) Deleting from Heaps
⌨️ (2:46:00) Heap Implementations
💻 (2:48:15) Graphs
⌨️ (2:49:25) Graph Basics
⌨️ (2:52:04) Directed vs. Undirected Graphs
⌨️ (2:53:45) Cyclic vs. Acyclic Graphs
⌨️ (2:55:04) Weighted Graphs
⌨️ (2:55:46) Types of Graphs
💻 (2:58:20) Conclusion
💻 (2:58:43) Shameless Plug

--

[NullPointerException]

Thanks again for the opportunity! Absolute pleasure working with you guys on this
-Steven (NPE)

[DxDy]

20:23 Array
43:32 ArrayList
1:05:02 Stack
1:18:03 Queue
1:28:18 LinkedList
1:47:20 Doubly-LinkedList
2:00:22 Dictionaries
2:16:40 Tree
2:29:02 Tries
2:38:27 Heaps
2:48:17 Graphs

[renishparghi]

This 3-hour video is my Entire 2 semester of my Computer Engineering!! such nicely composed Video. Definitely recommend for beginners! Cheers!

[kameshparashar]

This guy taught me C++, Python and now DS.
He's truly amazing.

[aminblm_german]

Timeline
00:00 Introduction
01:06 Timestamps
01:23 Script and Visuals
01:34 References + Research
01:56 Questions
02:12 Shameless Plug
02:51 What are Data Structures?
04:36 Series Overview
06:55 Measuring Efficiency with BigO Notation
09:45 Time Complexity Equations
11:13 The Meaning of BigO
12:42 Why BigO?
13:18 Quick Recap
14:27 Types of Time Complexity Equations
19:42 Final Note on Time Complexity Equations
20:21 The Array
20:58 Array Basics
22:09 Array Names
22:59 Parallel Arrays
23:59 Array Types
24:30 Array Size
25:45 Creating Arrays
26:11 Populate-First Arrays
28:09 Populate-Later Arrays
30:22 Numerical Indexes
31:57 Replacing information in an Array
32:42 2-Dimensional Arrays
35:01 Arrays as a Data Structure
42:21 Pros and Cons
43:33 The ArrayList
44:42 Structure of the ArrayList
45:19 Initializing an ArrayList
47:34 ArrayList Functionality
49:30 ArrayList Methods
50:26 Add Method
53:57 Remove Method
55:33 Get Method
55:59 Set Method
56:57 Clear Method
57:30 toArray Method
59:00 ArrayList as a Data Structure
1:03:12 Comparing and Contrasting with Arrays
1:05:02 The Stack
1:05:06 The Different types of Data Structures
1:05:51 Random Access Data Structures
1:06:10 Sequential Access Data Structures
1:07:36 Stack Basics
1:09:01 Common Stack Methods
1:09:45 Push Method
1:10:32 Pop Method
1:11:46 Peek Method
1:12:27 Contains Method
1:13:23 Time Complexity Equations
1:15:28 Uses for Stacks
1:18:01 The Queue
1:18:51 Queue Basics
1:20:44 Common Queue Methods
1:21:13 Enqueue Method
1:22:20 Dequeue Method
1:23:08 Peek Method
1:24:15 Contains Method
1:25:05 Time Complexity Equations
1:27:05 Common Queue Uses
1:28:16 The Linked List
1:31:37 LinkedList Visualization
1:33:55 Adding and Removing Information
1:41:28 Time Complexity Equations
1:44:26 Uses for LinkedLists
1:47:19 The Doubly-LinkedList
1:48:44 Visualization
1:50:56 Adding and Removing Information
1:58:30 Time Complexity Equations
1:59:06 Uses of a Doubly-LinkedList
2:00:21 The Dictionary
2:01:15 Dictionary Basics
2:02:00 Indexing Dictionaries
2:02:40 Dictionary Properties
2:05:53 Hash Table Mini-Lesson
2:13:26 Time Complexity Equations
2:16:39 Trees
2:16:55 Introduction to Hierarchical Data
2:18:54 Formal Background on the Tree
2:20:03 Tree Terminology and Visualization
2:25:08 Different types of Trees
2:28:07 Uses for the Tree
2:29:00 Tries
2:29:50 Trie Basics
2:30:41 Trie Visualization
2:34:33 Flagging
2:35:15 Uses for Tries
2:38:25 Heaps
2:38:51 Heap Basics
2:39:19 Min-Heaps
2:40:07 Max-Heaps
2:40:59 Building Heaps
2:44:20 Deleting from Heaps
2:46:00 Heap Implementations
2:48:15 Graphs
2:49:25 Graph Basics
2:52:04 Directed vs. Undirected Graphs
2:53:45 Cyclic vs. Acyclic Graphs
2:55:04 Weighted Graphs
2:55:46 Types of Graphs
2:58:20 Conclusion
2:58:43 Shameless Plug

[NOCDIB]

I graduated with my BS in Computer Science 16 years ago and, I must say, this video is a good conceptual refresher.

[rishikumarjha]

Free code camp is heaven for us ....who can't pay on some online courses

[shervinmokthari]

35 mins in, i am absolutely engrossed & loving the concise breakdown. Much love!

[silentlessons]

just 20 minutes in and I realise i struggled with this concept at university for an entire semester solely because of the way the lecturers taught. Many thanks indeed for this

[inponderland]

Steven, this video was awesome! You clearly put a lot of preparation into your lessons, and the slide visuals are top notch compared to most other CS educational videos. You definitely earned a subscriber

[strictnonconformist]

I’ve recommended this to my 40+ years-old friend that decided to learn to code in C++ (hell of a first language, like juggling flaming chainsaws while on a tightrope over a pool of hungry sharks) after my Comcast cable app on autoplay through this up while I was sleeping, and I woke up in the middle of it. I wish I had run into this decades ago when I first started!

This video has clear oration at an appropriate pace, great graphics, and covers a lot of data structures and where they’re used in a logical manner. Some people do best with graphical teaching, some with words, this appears to cover a fair number of learning styles: now students just need to learn by doing, but at least this is a great (and FREE!) audiovisual lecture, that can easily be rewound to desired spots (and the description has a nice time reference table of contents) for what they want to review.

[aparnamahalingam]

This was the first and ONLY video tutorial that I stuck around to watch in its ENTIRETY on data structures, because I genuinely needed the knowledge. Well done. Very awesome explanations; the use cases were especially splendid!

[sumanthhegde]

The effort that went into this, the quality of the content and the presentation... Just REMARKABLE! Looking forward to learn a lot more from you. Thank You!

[treyquattro]

34:25 - two-dimensional arrays are by default row, column. The programmer can address a 2- or n-dimensional array any way they want (so long as the indices are within bounds) but the convention is array[row][column] not [column][row]. Using anything other than [row][column] will confuse other programmers and probably lead to errors. [2][2] was a bad example because it will result in the same element being addressed. Elements [2][1] and [1][2] are different ("Marcus" and "Quinten" by conventional addressing).

[kia]

Wow, it's the best teaching video, for a non computer science background student, you make it easy to understand everything.... Thank you so much 😊😊😊

[joneswafula]

Very engrossing. The video is broken down to very simple forms that makes it quite a joy to watch through. Thanks man, you're a great teacher! 😊

[mayxx]

Thank you for this vid. It's actually a great timing coz I'll be taking data structures for my class probably next week. A great start for beginners like me. ❤

[jonahrivera]

This video is so underrated. This is exactly what I needed for my Data Structures class. Thank you my braddah you are the man!!!!

[amahlejenete]

Have not seen/found any other video better than this one on Data structures. A definite must watch!

[kannalix-amsmhss]

⭐️ Course Contents ⭐️

💻 (00:00) Introduction
⌨️ (01:06) Timestamps
⌨️ (01:23) Script and Visuals
⌨️ (01:34) References + Research
⌨️ (01:56) Questions
⌨️ (02:12) Shameless Plug
⌨️ (02:51) What are Data Structures?
⌨️ (04:36) Series Overview
💻 (06:55) Measuring Efficiency with BigO Notation
⌨️ (09:45) Time Complexity Equations
⌨️ (11:13) The Meaning of BigO
⌨️ (12:42) Why BigO?
⌨️ (13:18) Quick Recap
⌨️ (14:27) Types of Time Complexity Equations
⌨️ (19:42) Final Note on Time Complexity Equations
💻 (20:21) The Array
⌨️ (20:58) Array Basics
⌨️ (22:09) Array Names
⌨️ (22:59) Parallel Arrays
⌨️ (23:59) Array Types
⌨️ (24:30) Array Size
⌨️ (25:45) Creating Arrays
⌨️ (26:11) Populate-First Arrays
⌨️ (28:09) Populate-Later Arrays
⌨️ (30:22) Numerical Indexes
⌨️ (31:57) Replacing information in an Array
⌨️ (32:42) 2-Dimensional Arrays
⌨️ (35:01) Arrays as a Data Structure
⌨️ (42:21) Pros and Cons
💻 (43:33) The ArrayList
⌨️ (44:42) Structure of the ArrayList
⌨️ (45:19) Initializing an ArrayList
⌨️ (47:34) ArrayList Functionality
⌨️ (49:30) ArrayList Methods
⌨️ (50:26) Add Method
⌨️ (53:57) Remove Method
⌨️ (55:33) Get Method
⌨️ (55:59) Set Method
⌨️ (56:57) Clear Method
⌨️ (57:30) toArray Method
⌨️ (59:00) ArrayList as a Data Structure
⌨️ (1:03:12) Comparing and Contrasting with Arrays
💻 (1:05:02) The Stack
⌨️ (1:05:06) The Different types of Data Structures
⌨️ (1:05:51) Random Access Data Structures
⌨️ (1:06:10) Sequential Access Data Structures
⌨️ (1:07:36) Stack Basics
⌨️ (1:09:01) Common Stack Methods
⌨️ (1:09:45) Push Method
⌨️ (1:10:32) Pop Method
⌨️ (1:11:46) Peek Method
⌨️ (1:12:27) Contains Method
⌨️ (1:13:23) Time Complexity Equations
⌨️ (1:15:28) Uses for Stacks
💻 (1:18:01) The Queue
⌨️ (1:18:51) Queue Basics
⌨️ (1:20:44) Common Queue Methods
⌨️ (1:21:13) Enqueue Method
⌨️ (1:22:20) Dequeue Method
⌨️ (1:23:08) Peek Method
⌨️ (1:24:15) Contains Method
⌨️ (1:25:05) Time Complexity Equations
⌨️ (1:27:05) Common Queue Uses
💻 (1:28:16) The Linked List
⌨️ (1:31:37) LinkedList Visualization
⌨️ (1:33:55) Adding and Removing Information
⌨️ (1:41:28) Time Complexity Equations
⌨️ (1:44:26) Uses for LinkedLists
💻 (1:47:19) The Doubly-LinkedList
⌨️ (1:48:44) Visualization
⌨️ (1:50:56) Adding and Removing Information
⌨️ (1:58:30) Time Complexity Equations
⌨️ (1:59:06) Uses of a Doubly-LinkedList
💻 (2:00:21) The Dictionary
⌨️ (2:01:15) Dictionary Basics
⌨️ (2:02:00) Indexing Dictionaries
⌨️ (2:02:40) Dictionary Properties
💻 (2:05:53) Hash Table Mini-Lesson
⌨️ (2:13:26) Time Complexity Equations
💻 (2:16:39) Trees
⌨️ (2:16:55) Introduction to Hierarchical Data
⌨️ (2:18:54) Formal Background on the Tree
⌨️ (2:20:03) Tree Terminology and Visualization
⌨️ (2:25:08) Different types of Trees
⌨️ (2:28:07) Uses for the Tree
💻 (2:29:00) Tries
⌨️ (2:29:50) Trie Basics
⌨️ (2:30:41) Trie Visualization
⌨️ (2:34:33) Flagging
⌨️ (2:35:15) Uses for Tries
💻 (2:38:25) Heaps
⌨️ (2:38:51) Heap Basics
⌨️ (2:39:19) Min-Heaps
⌨️ (2:40:07) Max-Heaps
⌨️ (2:40:59) Building Heaps
⌨️ (2:44:20) Deleting from Heaps
⌨️ (2:46:00) Heap Implementations
💻 (2:48:15) Graphs
⌨️ (2:49:25) Graph Basics
⌨️ (2:52:04) Directed vs. Undirected Graphs
⌨️ (2:53:45) Cyclic vs. Acyclic Graphs
⌨️ (2:55:04) Weighted Graphs
⌨️ (2:55:46) Types of Graphs
💻 (2:58:20) Conclusion
💻 (2:58:43) Shameless Plug