Intermediate Algorithms: Graphs, Trees, and Backtracking
Completed by Noor Hasan Ahmed
April 28, 2026
14 hours (approximately)
Noor Hasan Ahmed's account is verified. Coursera certifies their successful completion of Intermediate Algorithms: Graphs, Trees, and Backtracking
What you will learn
Master depth-first and breadth-first search techniques for trees and graphs.
Implement advanced algorithms for backtracking and solving string-related problems.
Solve real-world graph traversal problems using DFS, BFS, and Union-Find.
Gain expertise in implementing and utilizing Tries and Heaps for efficient data storage and retrieval.
Skills you will gain
- Category: Algorithms
- Category: Computational Thinking
- Category: Graph Theory
- Category: Data Structures
