Tomadora
Trees, Graphs & Recursion
AI-generated course covering: Recursion Fundamentals, Introduction to Trees & Binary Trees, Binary Search Trees & Balanced Trees, Heaps and Priority Queues, Graph Representation & Traversal, Shortest Path Algorithms, Minimum Spanning Trees & Topological Sort
Intermediate
27 lessons
614 questions
Download Tomadora to start →
What you'll learn
This course is part of the DSA & Interview Prep track on Tomadora. It covers 7 progressive modules with 27 bite-sized lessons, totalling 614 interactive questions including flashcards, multiple choice, true/false, typing, matching, and fill-in-the-blank.
Course syllabus
Recursion Fundamentals
Master the core concepts of recursion, including base cases, recursive calls, call stack, and tail recursion. Explore common recursive patterns like factorial and Fibonacci, laying the groundwork for complex data structures.
- Introduction to Recursive Thinking (19 questions)
- The Call Stack and Execution Flow (18 questions)
- Divide and Conquer: Recursive Problem Solving (23 questions)
- Advanced Topics and Practical Considerations (24 questions)
Introduction to Trees & Binary Trees
Understand tree terminology, properties, and various types of trees. Dive deep into binary trees, their representations, and fundamental operations like insertion, deletion, and traversal (in-order, pre-order, post-order, level-order).
- Introduction to Trees: Fundamentals and Terminology (16 questions)
- Binary Trees: Structure and Types (32 questions)
- Tree Traversal Techniques (22 questions)
- Binary Search Trees (BST): Properties and Basic Operations (22 questions)
Binary Search Trees & Balanced Trees
Explore Binary Search Trees (BSTs), their properties, and efficient search, insert, and delete operations. Learn about the importance of balanced trees (e.g., AVL, Red-Black - conceptual overview) and their role in maintaining optimal performance.
- Introduction to Binary Search Trees: Structure and Basic Operations (20 questions)
- Exploring Advanced BST Operations and the Need for Balancing (30 questions)
- AVL Trees: Principles of Self-Balancing and Rotations (28 questions)
- Beyond AVL: Red-Black Trees, B-Trees, and Real-World Applications (20 questions)
Heaps and Priority Queues
Discover heap data structures (min-heap, max-heap), their array-based representation, and core operations like heapify, insert, and extract-min/max. Understand their application in implementing priority queues and algorithms like heapsort.
- Understanding Priority Queues and The Heap Data Structure (26 questions)
- Implementing Binary Heap Operations: Insert, Delete, and Build (23 questions)
- Heapsort and Practical Applications of Priority Queues (18 questions)
Graph Representation & Traversal
Introduce graph terminology, types of graphs (directed, undirected, weighted), and different representations (adjacency matrix, adjacency list). Master fundamental graph traversal algorithms: Breadth-First Search (BFS) and Depth-First Search (DFS).
- Introduction to Graphs: Definitions and Terminology (23 questions)
- Graph Representation: Adjacency Matrix and List (28 questions)
- Graph Traversal: Breadth-First Search (BFS) (28 questions)
- Graph Traversal: Depth-First Search (DFS) (21 questions)
Shortest Path Algorithms
Learn classic shortest path algorithms including Dijkstra's algorithm for single-source shortest paths in non-negative weighted graphs and Bellman-Ford for graphs with negative weights.
- Introduction to Shortest Path Problems & BFS (12 questions)
- Dijkstra's Algorithm for Single-Source Shortest Paths (22 questions)
- Bellman-Ford Algorithm & Negative Cycles (21 questions)
- All-Pairs Shortest Paths (Floyd-Warshall) & Algorithm Comparison (13 questions)
Minimum Spanning Trees & Topological Sort
Explore algorithms for finding Minimum Spanning Trees (MSTs) like Prim's and Kruskal's. Understand the concept of topological sorting for Directed Acyclic Graphs (DAGs) and its practical applications.
- Introduction to Minimum Spanning Trees (28 questions)
- Algorithms for Minimum Spanning Trees (29 questions)
- Introduction to Topological Sort (17 questions)
- Algorithms for Topological Sort (31 questions)
Frequently asked questions
- What is the Trees, Graphs & Recursion course?
- Trees, Graphs & Recursion is a intermediate course on Tomadora covering 7 modules and 27 lessons. It is designed to be completed in 5-minute bursts during your work breaks, using a Pomodoro-style focus + learn cycle.
- How long does Trees, Graphs & Recursion take to finish?
- Each lesson takes about 5 minutes. With 27 lessons, you can finish the course in roughly 3 hours of total learning time, spread across as many breaks as you like.
- Is Trees, Graphs & Recursion free?
- Yes. Tomadora is free to download and the entire DSA & Interview Prep track — including Trees, Graphs & Recursion — is free to learn.
- What level is Trees, Graphs & Recursion?
- Trees, Graphs & Recursion is rated Intermediate. Some familiarity with the basics is helpful but not required.
- What language is Trees, Graphs & Recursion taught in?
- Trees, Graphs & Recursion is taught in English.
More courses in DSA & Interview Prep