EulerFold
ToolsGeneratorPlannerPractice
Research & LibraryResearchArticlesLibraryLeaderboard
PlatformAboutPricing
Get Started
Aspiring Software Engineers

Data Structures: Trees & Graphs

8 weeks
0 Learners
eulerfoldeulerfold
Jul 23

“Master the absolute fundamentals of Data Structures: Trees & Graphs through hands-on technical deep dives. Rather than skimming surface-level tutorials, this track enforces rigorous conceptual understanding and practical implementation. Expect to walk away with a profound mastery of the underlying architecture and the ability to solve complex engineering challenges.”

Share:

About this Course

The fundamental CS knowledge required for Vector Search (HNSW), Parsers, and Databases. This Aspiring Software Engineers curriculum is designed to give you hands-on experience and deep conceptual understanding. Across 8 intensive modules, you'll tackle real-world challenges and build practical projects that reinforce your learning. By the end of this journey, you'll have the skills and proof of work to demonstrate your expertise.

What you'll learn

Understand tree structures and recursive traversal.
Utilize trees for efficient search operations.
Ensure O(log n) time complexity by maintaining tree balance.
Explore trees used in database indexing and operating systems.

Prerequisites

intermediate Level

Requires basic familiarity with the tech stack.

  • Familiarity with core concepts

Ideal for

Aspiring Software Engineers

Data Engineers
W1

Binary Trees and Traversals

Dive deep into the internals of Binary Trees and Traversals by comprehensively studying tree properties and traversal algorithms.

2 videos•27m
2 readings
2 topics
1 homework
Learn

Topics

1.1
Tree Properties
16 minutes
1.2
Traversal Algorithms
11 minutes

Study Resources

→Tree traversal - Wikipedia→Preorder, Inorder and Postorder Traversal using Recursion
W2

Binary Search Trees (BST)

Construct reliable, production-ready workflows for Binary Search Trees (BST) by comprehensively studying bst mechanics and modification.

2 videos•63m
3 readings
2 topics
1 homework
Learn
W3

Balanced Trees: AVL Trees

Master the practical implementation of Balanced Trees: AVL Trees by comprehensively studying the balance factor and tree rotations.

2 videos•54m
3 readings
2 topics
1 homework
Learn
W4

Advanced Trees

Master the practical implementation of Advanced Trees by comprehensively studying red-black trees and other tree types.

2 videos•37m
3 readings
2 topics
1 homework
Learn
W5

Graph Fundamentals and Representations

Gain a deep understanding of Graph Fundamentals and Representations by comprehensively studying graph terminology and representations.

2 videos•48m
3 readings
2 topics
1 homework
Learn
W6

Graph Traversal Algorithms

Dive deep into the internals of Graph Traversal Algorithms by comprehensively studying breadth-first search (bfs) and depth-first search (dfs).

2 videos•71m
3 readings
2 topics
1 homework
Learn
W7

Shortest Path Algorithms

Dive deep into the internals of Shortest Path Algorithms by comprehensively studying dijkstra's algorithm and alternative algorithms.

2 videos•30m
3 readings
2 topics
1 homework
Learn
W8

Advanced Graph Algorithms

Develop an intuitive mental model for Advanced Graph Algorithms by comprehensively studying minimum spanning trees and directed acyclic graphs (dags).

2 videos•58m
2 readings
2 topics
1 homework
Learn
01

Learn

Watch curated videos and read study resources

02

Practice

Practice what you learned

03

Build Projects

Build projects using your new gained knowledge

04

Submit & Verify

Submit your project and get verified by our system

References

01Tree traversal - Wikipedia
02Preorder, Inorder and Postorder Traversal using Recursion
03Binary Search Trees (BSTs): Properties, Insertion, Deletion ...
04Insertion in Binary Search Tree (BST) - GeeksforGeeks
05Binary Search Tree Operations: Insert, Delete, Search
06AVL Trees: Self-Balancing Binary Search Trees | by Abdul... | Medium
07AVL Trees: Self-Balancing Binary Search Trees | Algor Cards
08AVL Tree Data Structure - GeeksforGeeks
09Types of Trees - GeeksforGeeks
10Introduction to Red-Black Tree - GeeksforGeeks
11Data Structures Exam Questions: Red-Black Trees & HeapsRed-Black and B-Tree Operations GuideData Structures and Algorithms: Red-Black TreesAdvanced Trees: AVL Trees, Red-Black Trees, and Heaps (Min ...DSA Trees - W3Schools
12Representation of Graph - GeeksforGeeks
13Comparison between Adjacency List and Adjacency Matrix ...
14Graph-Based Data Structures: Adjacency List, Matrix, and Edge ...
15Breadth First Search or BFS for a Graph - GeeksforGeeks
16Graph Traversal Algorithms Explained: DFS, BFS & Applications
17Compare BFS and DFS | Graph Traversal Algorithms
18Bellman Ford Algorithm. You are given a Weighted Graph. | Medium
19Dijkstra vs Bellman-Ford: Shortest Path Algorithm Guide – TildAlice
20Shortest path algorithms — Dijkstra & Bellman-Ford | Dev Genius
21Minimum Spanning Tree - Kruskal - Algorithms for Competitive...
22Minimum Spanning Tree - Kruskal & Prim Algorithms | DSA Tutorial
Rate this course
0.0
0 reviews

Community Insights

0

Join the discussion

Sign in to share your thoughts and technical insights.

Loading insights...