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

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

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

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

Trees and Graphs: Basics

Курс от University of Colorado Boulder
Продвинутый≈ 34.1 чАнглийский
О курсеНавыкиПрограммаПреподаватели

О курсе

Basic algorithms on tree data structures, binary search trees, self-balancing trees, graph data structures and basic traversal algorithms on graphs. This course also covers advanced topics such as kd-trees for spatial data and algorithms for spatial data. Trees and Graphs: Basics can be taken for academic credit as part of CU Boulder’s Master of Science in Data Science (MS-DS) degree offered on the Coursera platform. The MS-DS is an interdisciplinary degree that brings together faculty from CU Boulder’s departments of Applied Mathematics, Computer Science, Information Science, and others. With performance-based admissions and no application process, the MS-DS is ideal for individuals with a broad range of undergraduate education and/or professional experience in computer science, information science, mathematics, and statistics. Learn more about the MS-DS program at https://www.coursera.org/degrees/master-of-science-data-science-boulder.

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

Graph TheoryAlgorithmsData StructuresTheoretical Computer ScienceAnalysisTree MapsPython Programming

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

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

01Binary Search Trees and Algorithms on Trees24 материалов

Course Overview

Course Updates and Accessibility SupportЧтениеEarn Academic Credit for your Work!ЧтениеCourse SupportЧтениеImportant PrerequisitesЧтение

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

Sriram Sankaranarayanan

Professor

Trees and Graphs: Basics
В каталоге вашей программы

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

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

Начать на Coursera

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

Обучение на Coursera

≈ 34.1 ч

4 модулей

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

Субтитры: Арабский, Французский, Бенгальский, Узбекский, Украинский, Китайский (Китай), Греческий, Итальянский, Бразильский португальский, Вьетнамский, Нидерландский, Корейский, Немецкий, Пушту, Урду, Русский, Тайский, Индонезийский, Шведский, Турецкий, Азербайджанский, Испанский, Дари, Хинди, Японский, Казахский, Венгерский, Польский

Часть программы вашего университета
Logistics: Textbook and ReadingsЧтение
Introduce Yourself!Обсуждение
Important Specialization InformationЧтение

Overview of Module 1

Overview of Module 1Чтение

Binary Search Trees -- Introduction and Properties

Binary Search Trees -- Introduction and PropertiesВидеоReading CLRS Chapter 12ЧтениеBasics of Binary Search TreesЗадание

Binary Search Trees -- Insertion and Deletion

Binary Search Trees -- Insertion and DeletionВидеоCLRS Chapter 12.1-12.3ЧтениеBinary Search Tree: Insert and DeleteЗадание

Red-Black Tree Basics

Red-Black Trees BasicsВидеоCLRS Chapter 13 - 13.1ЧтениеRed-Black Tree BasicsЗадание

Red-Black Trees -- Rotations/Algorithms for Insertion (and Deletion)

Red-Black Trees -- Rotations/Algorithms for Insertion (and Deletion)ВидеоCLRS Chapter 13.2 - 13.3ЧтениеTree RotationsЗадание

Skip Lists

Skip ListsВидеоSkip ЧтениеSkip ListsЗадание

Problem Set #1

Binary Search TreesПрограммирование
02Basics of Graphs and Graphs Traversals18 материалов

Overview of Module 2

Overview of Module 2Чтение

Graphs and their Representations

Graphs and Their RepresentationsВидеоCLRS Chapter 22 (Section 22.1)ЧтениеGraph RepresentationsЗадание

Graph Traversals and Breadth First Traversal

Graph Traversals and Breadth First TraversalВидеоCLRS Chapter 22 (Section 22.2)Чтение

Depth First Search

Depth First SearchВидеоCLRS Chapter 22 (Section 22.3)ЧтениеCombined Quiz on Graph TraversalsЗадание

Topological Sorting and Applications

Topological Sorting and ApplicationsВидеоCLRS Chapter 22 (Section 22.4ЧтениеTopological Sort GraphsЗадание

Finding Strongly Connected Components

Strongly Connected Components - DefinitionsВидеоStrongly Connected Components - PropertiesВидеоStrongly Connected Components - AlgorithmВидеоCLRS Chapter 22 (Section 22.5)ЧтениеStrongly Connected ComponentsЗадание

Problem Set #2

GraphsПрограммирование
03Union-Find Data Structures and Spanning Tree Algorithms15 материалов

Overview of Module 3

Overview of Module 3Чтение

Amortized Analysis

Amortized Analysis of Data StructuresВидеоAmortized Analysis: Potential FunctionsВидеоCLRS Chapter 17ЧтениеAmortized AnalysisЗадание

Spanning Trees and Minimal Spanning Trees with Applications

Spanning Trees and Minimal Spanning Trees with ApplicationsВидеоCLRS Chapter 23 (Section 23.1)ЧтениеMinimum Spanning TreeЗадание

Kruskal’s Algorithm for Finding Minimal Spanning Trees

Kruskal’s Algorithm for Finding Minimal Spanning TreesВидеоCLRS Chapter 23 (Section 23.2)ЧтениеKruskal's AlgorithmЗадание

Union-Find Data Structures and Rank Compression

Union-Find Data Structures and Rank CompressionВидеоCLRS Chapter 21ЧтениеDisjoint Set ForestЗадание

Problem Set #3

Spanning Trees and Union-Find Data StructureПрограммирование
04Shortest Path Algorithms16 материалов

Overview of Module 4

Overview of Module 4Чтение

Shortest Path Problems and Their Properties

Shortest Path Problems and Their PropertiesВидеоCLRS Chapter 24 (up to section 24.1)ЧтениеShortest Path Problems PropertiesЗадание

Bellman-Ford Algorithm for Single Source Shortest Paths

Bellman-Ford Algorithm for Single Source Shortest PathsВидеоCLRS Chapter 24 (Section 24.1)ЧтениеShortest Path - Bellman Ford AlgorithmЗадание

Dijkstra’s Algorithm for Single Source Shortest Paths with Nonnegative Edge Weights

Dijkstra’s Algorithm for Single Source Shortest Paths with Nonnegative Edge WeightsВидеоProof of Dijkstra's AlgorithmВидеоCLRS Chapter 24 (Section 24.3 and 24.5)ЧтениеDijkstra's AlgorithmЗадание

Shortest Path on DAGs

Shortest Path on DAGsВидеоCLRS Chapter 24 (Section 24.2)Чтение

All Pairs Shortest Path Problems and Floyd-Warshall’s Algorithm

All Pairs Shortest Path Problems and Floyd-Warshall’s AlgorithmВидеоCLRS Chapter 25 (Sections 25.1 and 25.2)Чтение

Problem Set #4

Shortest Path AlgorithmsПрограммирование