К содержимому
learnspaceYOUR NEXT CHAPTER
ПРОСТРАНСТВО ОБУЧЕНИЯ
ГлавнаяКаталог курсовМоё обучениеCoursera

Знания без границ

Учитесь у лучших университетов и компаний мира.

Открыть Coursera
Интеграция
Пространство университета
Моё пространствоСтраница курса
↵
ЯЛичный кабинетСтудент
© 2026 LearnSpaceКаждый день — возможность узнать больше.Помощь
Intermediate Algorithms: Graphs, Trees, and Backtracking · LearnSpace
Назад в каталог
courseraПрограммирование

Intermediate Algorithms: Graphs, Trees, and Backtracking

Курс от Packt
Средний≈ 15.3 чАнглийский
О курсеНавыкиПрограммаПреподаватели

О курсе

This course features Coursera Coach! A smarter way to learn with interactive, real-time conversations that help you test your knowledge, challenge assumptions, and deepen your understanding as you progress through the course. Unlock the power of advanced algorithms with a focus on graphs, trees, and backtracking. Through this course, you will learn how to apply depth-first and breadth-first search techniques to solve problems in trees and graphs. From the basics of binary trees to complex graph traversals and backtracking algorithms, this course provides an in-depth exploration of key data structures and techniques used to solve real-world algorithmic challenges. The course kicks off with the essential concepts of binary trees, including traversal techniques like DFS and BFS. You'll work through problems like inverting a binary tree, calculating its maximum depth, and validating whether a binary tree is a binary search tree. As you progress, you’ll explore backtracking algorithms for solving problems such as the Combination Sum and Word Search, and dive into more advanced data structures like Tries to solve complex string-searching problems. Later in the course, you’ll tackle graphs and how to work with algorithms like Union-Find to determine connected components or verify the validity of a graph. You’ll also explore how to solve real-world problems such as Pacific Atlantic water flow, course schedules, and alien dictionaries through graph traversal techniques. This course is designed for learners with a basic understanding of data structures and algorithms who want to delve deeper into intermediate concepts. It’s perfect for anyone preparing for technical interviews or looking to expand their algorithmic problem-solving toolkit. By the end of the course, you will be able to solve complex graph and tree problems, apply backtracking techniques, and efficiently use advanced data structures like Tries and Heaps in real-world scenarios.

Навыки, которые вы освоите

AlgorithmsData StructuresGraph TheoryData Validation

Программа курса

5 модулей · 39 учебных материалов

01Trees: DFS / BFS15 материалов

Trees: DFS / BFS

Introduction to the Course 'Intermediate Algorithms: Graphs, Trees, and Backtracking'ЧтениеFull Specialization ResourcesЧтениеInvert Binary Tree / 226ВидеоMaximum Depth of Binary Tree / 104Видео

Учитесь у экспертов

Packt - Course Instructors

Преподаватель курса

Intermediate Algorithms: Graphs, Trees, and Backtracking
В каталоге вашей программы

Инвестируйте в себя

Новые знания — в удобное для вас время.

Начать на Coursera

Обучение откроется на Coursera
в новой вкладке

Обучение на Coursera

≈ 15.3 ч

5 модулей

Язык: Английский

Часть программы вашего университета
Same Tree / 100Видео
Subtree of Another Tree / 572Видео
Lowest Common Ancestor of a Binary Search Tree / 235Видео
Binary Tree Level Order Traversal / 102Видео
Validate Binary Search Tree / 98Видео
Kth Smallest Element in a BST / 230Видео
Construct Binary Tree from Preorder and Inorder Traversal / 105Видео
Binary Tree Maximum Path Sum / 124Видео
Serialize and Deserialize Binary Tree / 297Видео
Constructing a Binary Tree from Preorder and Inorder TraversalDIALOGUE
Trees: DFS / BFS - AssessmentЗадание
02Backtracking4 материалов

Backtracking

Combination Sum / 39ВидеоWord Search / 79ВидеоBacktracking to Find Combination SumDIALOGUEBacktracking - AssessmentЗадание
03Tries5 материалов

Tries

Implement Trie (Prefix Tree) / 208ВидеоDesign Add and Search Words Data Structure / 211ВидеоWord Search II / 212ВидеоImplementing Trie for String Search and Prefix MatchingDIALOGUETries - AssessmentЗадание
04Heap: Priority Queue3 материалов

Heap: Priority Queue

Find Median from Data Stream / 295ВидеоFinding the Median in a Data Stream Using HeapsDIALOGUEHeap: Priority Queue - AssessmentЗадание
05Graph: DFS / BFS / Union Find12 материалов

Graph: DFS / BFS / Union Find

Number of Islands / 200ВидеоClone Graph / 133ВидеоPacific Atlantic Water Flow / 417ВидеоGraph Valid Tree / 261ВидеоNumber of Connected Components In An Undirected Graph / 323ВидеоCourse Schedule / 207ВидеоAlien Dictionary / 269ВидеоConclusion to the Course 'Intermediate Algorithms: Graphs, Trees, and Backtracking'ЧтениеGraph Cycle Detection Using DFSDIALOGUEGraph: DFS / BFS / Union Find - AssessmentЗаданиеFull Course Practice AssessmentЗаданиеFull Course AssessmentЗадание