Data Structures in JavaScript for Beginners
What’s included
$14.99 / $24.99
Get ready for your exam by enrolling in our comprehensive training course. This course includes a full set of instructional videos designed to equip you with in-depth knowledge essential for passing the certification exam with flying colors.
Pay once, own it forever
Video Courses
Introduction to Data Structures and Important Concepts
| Lectures | Duration |
|---|---|
| 1. What Are Data Structures and Why Are They Important? | 4m 16s |
| 2. Constructor Functions and the "this" Keyword | 9m 47s |
| 3. The Prototype Object | 5m 56s |
1. What Are Data Structures and Why Are They Important?
4m 16s
2. Constructor Functions and the "this" Keyword
9m 47s
3. The Prototype Object
5m 56s
Linked Lists
| Lectures | Duration |
|---|---|
| 1. What is a Linked List? | 2m 35s |
| 2. Linked List and "Node" Constructor Functions | 6m 35s |
| 3. Add To Head - part 1 | 3m 19s |
| 4. Add To Head - part 2 | 6m 56s |
| 5. Using Add To Head | 5m 6s |
| 6. Add To Tail | 2m 49s |
| 7. Testing Add To Tail and Add To Head | 4m 17s |
| 8. Remove Head | 5m 22s |
| 9. Remove Tail | 4m 5s |
| 10. Search Method | 6m 29s |
| 11. Testing Search | 2m 50s |
| 12. Linked List - Independent Exercise | 1m 10s |
| 13. Linked List - Exercise Review | 5m 10s |
| 14. Big O Notation and Calculating the Runtime of a Function | 8m 55s |
| 15. Linked List Wrap-Up | 4m 28s |
1. What is a Linked List?
2m 35s
2. Linked List and "Node" Constructor Functions
6m 35s
3. Add To Head - part 1
3m 19s
4. Add To Head - part 2
6m 56s
5. Using Add To Head
5m 6s
6. Add To Tail
2m 49s
7. Testing Add To Tail and Add To Head
4m 17s
8. Remove Head
5m 22s
9. Remove Tail
4m 5s
10. Search Method
6m 29s
11. Testing Search
2m 50s
12. Linked List - Independent Exercise
1m 10s
13. Linked List - Exercise Review
5m 10s
14. Big O Notation and Calculating the Runtime of a Function
8m 55s
15. Linked List Wrap-Up
4m 28s
Binary Search Trees
| Lectures | Duration |
|---|---|
| 1. What is a Binary Search Tree? | 5m 51s |
| 2. Recursion - part 1 | 4m 20s |
| 3. Recursion part 2 and the Call Stack | 5m 19s |
| 4. Insert Method | 8m 8s |
| 5. Testing Insert | 3m 2s |
| 6. Contains Method | 3m 53s |
| 7. Testing Contains | 2m 4s |
| 8. Depth First Traversal - In-Order | 7m 14s |
| 9. Testing Depth First Traversal In-Order | 1m 53s |
| 10. Refactoring Depth First Traversal Method | 2m 33s |
| 11. Depth First Traversal - Pre-Order | 2m 46s |
| 12. Testing Depth First Traversal Pre-Order | 1m 23s |
| 13. Depth First Traversal - Post-Order | 3m 39s |
| 14. Breadth First Traversal - part 1 | 3m 37s |
| 15. Breadth First Traversal - part 2 | 6m 15s |
| 16. Testing Breadth First Traversal | 2m 34s |
| 17. Binary Search Tree - Exercise Review | 3m 8s |
| 18. Binary Search Tree Wrap-up | 3m 26s |
1. What is a Binary Search Tree?
5m 51s
2. Recursion - part 1
4m 20s
3. Recursion part 2 and the Call Stack
5m 19s
4. Insert Method
8m 8s
5. Testing Insert
3m 2s
6. Contains Method
3m 53s
7. Testing Contains
2m 4s
8. Depth First Traversal - In-Order
7m 14s
9. Testing Depth First Traversal In-Order
1m 53s
10. Refactoring Depth First Traversal Method
2m 33s
11. Depth First Traversal - Pre-Order
2m 46s
12. Testing Depth First Traversal Pre-Order
1m 23s
13. Depth First Traversal - Post-Order
3m 39s
14. Breadth First Traversal - part 1
3m 37s
15. Breadth First Traversal - part 2
6m 15s
16. Testing Breadth First Traversal
2m 34s
17. Binary Search Tree - Exercise Review
3m 8s
18. Binary Search Tree Wrap-up
3m 26s
Hash Tables
| Lectures | Duration |
|---|---|
| 1. What is a Hash Table? | 6m 44s |
| 2. Hash Table and Hash Node Constructor Functions | 4m 45s |
| 3. CharCodeAt Method and Modulus Operator | 4m 20s |
| 4. Hash Method | 4m 46s |
| 5. Insert Method | 5m 34s |
| 6. Testing Insert Method | 3m 20s |
| 7. Refactoring Insert Method | 5m 46s |
| 8. Testing Refactored Insert Method | 2m 24s |
| 9. Get Method | 4m 54s |
| 10. Testing Get Method | 1m 44s |
| 11. Hash Table - Independent Exercise | 49s |
| 12. Hash Table - Exercise Review | 4m 56s |
| 13. Hash Table Wrap-up | 2m 6s |
1. What is a Hash Table?
6m 44s
2. Hash Table and Hash Node Constructor Functions
4m 45s
3. CharCodeAt Method and Modulus Operator
4m 20s
4. Hash Method
4m 46s
5. Insert Method
5m 34s
6. Testing Insert Method
3m 20s
7. Refactoring Insert Method
5m 46s
8. Testing Refactored Insert Method
2m 24s
9. Get Method
4m 54s
10. Testing Get Method
1m 44s
11. Hash Table - Independent Exercise
49s
12. Hash Table - Exercise Review
4m 56s
13. Hash Table Wrap-up
2m 6s