A Perfectly Structured Course
Course Content
6 Hours . 7 Sections . 130 Lessons
Getting Started(50s)
- Introduction0m 50s
- Source Code
- Follow Me Around
- Learning Paths
A Course You'll Actually Finish
Ultimate Data Structures & Algorithms: Part 2
Ace your coding job interview. Learn to write better and faster code.
- Intermediate
- 6 Hours
- 130 Lessons
- Downloadable Content
- Hands-on Exercises
- English Captions
- Certificate of Completion
- Lifetime Access
- Learn at Your Own Pace
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.
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
Target Student
Who Is This For?
- Anyone preparing for a coding job interview
- Computer science students whose lecturers failed to explain the topics
- Self-taught developers who missed out on a computer science degree
- Anyone who wants to become a better developer
What You Should Know First
Prerequisites
This course is the second part of a series. So you should have watched the first part or have a solid understanding of the concepts covered there.
Here are the courses we recommend if you need to strengthen the fundamentals.
Ace your coding job interview. Learn to write better and faster code.
This course is only available as part of
The Ultimate Data Structures & Algorithms Bundle
Get the Full Series