1 💻 Introduction 1:05
2 ⌨️ Timestamps 0:16
3 ⌨️ Script and Visuals 0:10
4 ⌨️ References + Research 0:21
5 ⌨️ Questions 0:15
6 ⌨️ Shameless Plug 0:38
7 ⌨️ What are Data Structures? 1:44
8 ⌨️ Series Overview 2:18
9 💻 Measuring Efficiency with BigO Notation 2:49
10 ⌨️ Time Complexity Equations 1:27
11 ⌨️ The Meaning of BigO 1:28
12 ⌨️ Why BigO? 0:35
13 ⌨️ Quick Recap 1:08
14 ⌨️ Types of Time Complexity Equations 5:14
15 ⌨️ Final Note on Time Complexity Equations 0:38
16 💻 The Array 0:36
17 ⌨️ Array Basics 1:10
18 ⌨️ Array Names 0:49
19 ⌨️ Parallel Arrays 0:59
20 ⌨️ Array Types 0:30
21 ⌨️ Array Size 1:14
22 ⌨️ Creating Arrays 0:25
23 ⌨️ Populate-First Arrays 1:57
24 ⌨️ Populate-Later Arrays 2:12
25 ⌨️ Numerical Indexes 1:34
26 ⌨️ Replacing information in an Array 0:44
27 ⌨️ 2-Dimensional Arrays 2:18
28 ⌨️ Arrays as a Data Structure 7:19
29 ⌨️ Pros and Cons 1:11
30 💻 The ArrayList 1:08
31 ⌨️ Structure of the ArrayList 0:36
32 ⌨️ Initializing an ArrayList 2:14
33 ⌨️ ArrayList Functionality 1:55
34 ⌨️ ArrayList Methods 0:55
35 ⌨️ Add Method 3:30
36 ⌨️ Remove Method 1:35
37 ⌨️ Get Method 0:25
38 ⌨️ Set Method 0:57
39 ⌨️ Clear Method 0:32
40 ⌨️ toArray Method 1:29
41 ⌨️ ArrayList as a Data Structure 4:11
42 ⌨️ Comparing and Contrasting with Arrays 1:49
43 💻 The Stack 0:03
44 ⌨️ The Different types of Data Structures 0:44
45 ⌨️ Random Access Data Structures 0:18
46 ⌨️ Sequential Access Data Structures 1:25
47 ⌨️ Stack Basics 1:24
48 ⌨️ Common Stack Methods 0:43
49 ⌨️ Push Method 0:46
50 ⌨️ Pop Method 1:13
51 ⌨️ Peek Method 0:40
52 ⌨️ Contains Method 0:55
53 ⌨️ Time Complexity Equations 2:04
54 ⌨️ Uses for Stacks 2:32
55 💻 The Queue 0:49
56 ⌨️ Queue Basics 1:52
57 ⌨️ Common Queue Methods 0:28
58 ⌨️ Enqueue Method 1:06
59 ⌨️ Dequeue Method 0:47
60 ⌨️ Peek Method 1:06
61 ⌨️ Contains Method 0:49
62 ⌨️ Time Complexity Equations 1:59
63 ⌨️ Common Queue Uses 1:10
64 💻 The Linked List 3:20
65 ⌨️ LinkedList Visualization 2:17
66 ⌨️ Adding and Removing Information 7:32
67 ⌨️ Time Complexity Equations 2:57
68 ⌨️ Uses for LinkedLists 2:52
69 💻 The Doubly-LinkedList 1:24
70 ⌨️ Visualization 2:11
71 ⌨️ Adding and Removing Information 7:33
72 ⌨️ Time Complexity Equations 0:35
73 ⌨️ Uses of a Doubly-LinkedList 1:14
74 💻 The Dictionary 0:53
75 ⌨️ Dictionary Basics 0:44
76 ⌨️ Indexing Dictionaries 0:39
77 ⌨️ Dictionary Properties 3:12
78 💻 Hash Table Mini-Lesson 7:32
79 ⌨️ Time Complexity Equations 3:12
80 💻 Trees 0:15
81 ⌨️ Introduction to Hierarchical Data 1:58
82 ⌨️ Formal Background on the Tree 1:08
83 ⌨️ Tree Terminology and Visualization 5:04
84 ⌨️ Different types of Trees 2:58
85 ⌨️ Uses for the Tree 0:52
86 💻 Tries 0:49
87 ⌨️ Trie Basics 0:50
88 ⌨️ Trie Visualization 3:51
89 ⌨️ Flagging 0:41
90 ⌨️ Uses for Tries 3:09
91 💻 Heaps 0:25
92 ⌨️ Heap Basics 0:27
93 ⌨️ Min-Heaps 0:47
94 ⌨️ Max-Heaps 0:51
95 ⌨️ Building Heaps 3:20
96 ⌨️ Deleting from Heaps 1:39
97 ⌨️ Heap Implementations 2:14
98 💻 Graphs 1:09
99 ⌨️ Graph Basics 2:38
100 ⌨️ Directed vs. Undirected Graphs 1:40
101 ⌨️ Cyclic vs. Acyclic Graphs 1:18
102 ⌨️ Weighted Graphs 0:41
103 ⌨️ Types of Graphs 2:33
104 💻 Conclusion 0:22
105 💻 Shameless Plug