This course was created with the
course builder. Create your online course today.
Start now
Create your course
with
Autoplay
Autocomplete
Previous Lesson
Complete and Continue
Data Structures and Algorithms
Introduction
Welcome (8:28)
How Computers Work (12:47)
What are Algorithms (5:29)
What are Data Structures (6:02)
The Big O Notation
Intro (6:36)
Constant O(1) (3:29)
Linear O(n) (4:43)
Quadratic O(n2) (5:38)
Logarithmic O(logn) (10:16)
Space Complexity (3:57)
Asymptotic Complexity (9:45)
Recursion
The Call Stack (9:54)
What is Recursion (9:08)
Potential Problems (8:35)
Recursion vs Iteration (8:22)
Big O of Recursive Functions (14:39)
Arrays and Hash Tables
Arrays (6:58)
Big O of Arrays (8:12)
Hash Tables (Dictionaries) (11:21)
Big O of Hash Tables (4:06)
Singly Linked Lists
Intro (7:22)
Append (11:32)
Prepend (5:04)
Pop Left (9:39)
Pop Right (9:45)
Remove (10:10)
Reverse (13:37)
Recap (6:43)
Doubly Linked Lists
Intro (3:03)
Append (5:07)
Prepend (3:48)
Pop Left (4:57)
Pop Right (4:31)
Remove (7:22)
Recap (4:05)
Stacks and Queues
Stacks - Intro (3:10)
Stacks - Array Implementation (2:47)
Stacks - Linked Lists Implementation (8:13)
Stacks - Recap (5:01)
Queues - Intro (4:04)
Queues - Linked Lists Implementation (6:30)
Queues - Deques (3:48)
Binary Search Trees
Trees Intro (11:41)
Binary Search Trees Intro (5:53)
Insert (13:36)
Contains (6:20)
Remove Intro (6:49)
Remove Node no Children (6:37)
Remove Node One Child (5:59)
Remove Node Two Children (12:44)
Tree Traversal
Intro (3:08)
Breadth First Traversal (14:13)
DFT Pre Order Iterative (10:20)
DFT Pre Order Recursive (14:07)
DFT In Order Iterative (12:26)
DFT In Order Recursive (7:41)
DFT Post Order Iterative (11:21)
DFT Post Order Recursive (6:51)
Recap (3:52)
Heaps
Intro (9:10)
Insert (14:30)
Remove Max (14:54)
Heapify (10:45)
Graphs
Intro (8:48)
Adding Vertices and Edges (5:31)
Removing Vertices and Edges (8:11)
Breadth First Traversal (17:51)
Depth First Traversal Iterative (7:45)
Depth First Traversal Recursive (8:17)
Sorting
Intro (5:18)
Insertion Sort (13:54)
Selection Sort (9:40)
Bubble Sort (11:04)
Shell Sort (13:22)
Heap Sort (12:46)
Merge Sort (27:40)
Quick Sort (22:46)
Radix Sort (24:05)
Congratulations
Congratulations and Thank You (1:37)
Welcome
Lesson content locked
If you're already enrolled,
you'll need to login
.
Enroll in Course to Unlock