Ultimate Data Structures & Algorithms: Part 2
Say goodbye to scattered tutorials and endless fluff. This course gives you a clear, structured path with bite-sized videos that blend theory and hands-on practice.
0
Students
101
Lectures
Code With Mosh
Instructor
About This Course
Highly Practical
What You'll Learn
- Binary Trees: Understand binary tree structure, traversal algorithms, and applications
- AVL Trees: Explore balanced binary search trees like AVL trees for efficient searching and insertion
- Heaps: Study min heaps and max heaps, including heapify operations and heap sort algorithm
- Tries: Delve into trie data structures for efficient word/key searching and storage
- Graphs: Learn about directed and undirected graphs, BFS, DFS, and other graph algorithm
Curriculum Overview
This course includes 7 modules, 101 lessons, and 0 hours of materials.
Getting Started
1 Parts
Introduction
Volume
50.2 MB
Binary Trees
19 Parts
Introduction
Free
Volume
47.1 MB
What are Trees
Volume
65.0 MB
Exercise- Populating a Binary Search Tree
Volume
1.3 MB
Exercise- Building a Tree
Volume
36.0 MB
Solution- insert()
Volume
172.7 MB
Solution- find()
Volume
36.5 MB
Traversing Trees
Volume
49.0 MB
Exercise- Tree Traversal
Volume
95.3 MB
Recursion
Volume
97.2 MB
Depth First Traversals
Volume
109.1 MB
Depth and Height of Nodes
Volume
107.2 MB
Minimum Value in a Tree
Volume
175.0 MB
Exercise- Equality Checking
Volume
18.0 MB
Solution- Equality Checking
Volume
98.9 MB
Exercise- Validating Binary Search Trees
Volume
37.2 MB
Solution- Validating Binary Search Trees
Volume
119.6 MB
Exercise- Nodes at K Distance
Volume
14.4 MB
Solution- Nodes at K Distance from the Root
Volume
141.2 MB
Level Order Traversal
Volume
47.8 MB
AVL Trees
17 Parts
Introduction
Free
Volume
2.8 MB
Balanced and Unbalanced Trees
Volume
43.0 MB
Rotations
Volume
43.7 MB
AVL Trees
Volume
28.3 MB
AVL Rotations
Volume
4.2 MB
Exercise- Building an AVL Tree
Volume
17.3 MB
Solution- insert()
Volume
233.4 MB
Exercise- Height Calculation
Volume
33.7 MB
Solution- Height Calculation
Volume
68.9 MB
Exercise- Balance Factor
Volume
45.2 MB
Solution- Balance Factor
Volume
134.8 MB
Exercise- Detecting Rotations
Volume
31.0 MB
Solution- Detecting Rotations
Volume
127.6 MB
Exercise- Implementing Rotations
Volume
81.0 MB
Solution- Implementing Rotations
Volume
219.4 MB
AVL Trees- Exercises
Volume
34.0 MB
Summary
Volume
7.6 MB
Heaps
16 Parts
Introduction
Free
Volume
1.9 MB
What are Heaps
Volume
44.2 MB
Exercise- Working with Heaps
Volume
4.0 MB
Exercise- Building a Heap
Volume
16.1 MB
Solution- insert()
Volume
193.1 MB
Solution- remove()
Volume
238.6 MB
Solution - Edge Cases
Volume
229.0 MB
Heap Sort
Volume
54.0 MB
Priority Queues
Volume
113.7 MB
Exercise- Heapify
Volume
18.1 MB
Solution- Heapify
Volume
185.0 MB
Solution- Optimization
Volume
56.8 MB
Exercise- Kth Largest Item
Volume
6.9 MB
Solution- Kth Largest Item
Volume
96.9 MB
Heaps- Exercises
Volume
43.5 MB
Summary
Volume
10.7 MB
Tries
16 Parts
Introduction
Free
Volume
2.2 MB
What are Tries
Volume
63.2 MB
Exercise- Populating a Trie
Volume
20.0 MB
Exercise- Building a Trie
Volume
21.4 MB
Solution- Building a Trie
Volume
127.9 MB
An Implementation with a HashTable
Volume
53.0 MB
A Better Abstraction
Volume
206.3 MB
Exercise- Looking Up a Word
Volume
20.8 MB
Solution- Looking Up a Word
Volume
61.2 MB
Traversals
Volume
81.8 MB
Exercise- Removing a Word
Volume
12.4 MB
Solution- Removing a Word
Volume
226.9 MB
Exercise- Auto Completion
Volume
16.6 MB
Solution- Auto Completion
Volume
175.2 MB
Tries- Exercises
Volume
43.0 MB
Summary
Volume
7.3 MB
Graphs
19 Parts
Introduction
Volume
2.2 MB
What are Graphs
Volume
15.9 MB
Adjacency Matrix
Volume
25.7 MB
Adjacency List
Volume
60.0 MB
Exercise- Building a Graph
Volume
15.3 MB
Solution- Adding Nodes and Edges
Volume
203.8 MB
Solution- Removing Nodes and Edges
Volume
110.2 MB
Traversal Algorithms
Volume
30.6 MB
Exercise- Traversal Algorithms
Volume
215 MB
Exercise- Depth-first Traversal (Recursive)
Volume
8.5 MB
Solution- Depth-first Traversal (Recursive)
Volume
99.2 MB
Exercise- Depth-first Traversal (Iterative)
Volume
50.4 MB
Solution- Depth-first Traversal (Iterative)
Volume
116.5 MB
Exercise- Breadth-first Traversal (Iterative)
Volume
10.4 MB
Solution- Breadth-first Traversal
Volume
63.6 MB
Exercise- Topological Sorting
Volume
51.4 MB
Solution- Topological Sort
Volume
111.0 MB
Exercise- Cycle Detection (Directed Graphs)
Volume
30.8 MB
Solution- Cycle Detection (Directed Graphs)
Volume
174.4 MB
Undirected Graphs
13 Parts
Introduction
Volume
2.7 MB
Exercise- Weighted Graphs
Volume
10.5 MB
Solution- Weighted Graphs
Volume
170.8 MB
An Object-oriented Solution
Volume
243.5 MB
Dijkstra_s Shortest Path Algorithm
Volume
42.2 MB
Exercise- Getting the Shortest Distance
Volume
146.7 MB
Solution- The Shortest Distance
Volume
160.3 MB
Solution- Shortest Path
Volume
267.2 MB
Exercise- Cycle Detection (Undirected Graphs)
Volume
15.8 MB
Solution- Cycle Detection (Undirected Graphs)
Volume
111.1 MB
Minimum Spanning Tree
Volume
11.2 MB
Exercise- Prim_s Algorithm
Volume
19.9 MB
Solution- Prim_s Algorithm
Volume
412.3 MB
0
0 Reviews
Content Quality (0)
Instructor Skills (0)
Value for Money (0)
Support Quality (0)
Course Specifications
Sections
7
Lessons
101
Capacity
Unlimited
Duration
6:00 Hours
Students
0
Access Duration
99999 Days
Created Date
17 Nov 2025
Updated Date
17 Nov 2025
You are viewing
Ultimate Data Structures & Algorithms: Part 2
Subscribe to Our Newsletter
Receive expert insights, course updates, and learning resources directly in your inbox and get notified
Additional Links
Login Register Contact Certificate Validation Become Instructor About Terms and PoliciesContact US
© 2025 Rocket Soft. All Rights Reserved. Empowering Learning Worldwide.
Reply to Comment