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
This course is part of Foundations of Data Structures and Algorithms Specialization

Instructor: Sriram Sankaranarayanan
Access provided by 糖心vlog官网观看 Learning Team
18,493 already enrolled
(155 reviews)
Recommended experience
What you'll learn
Define basic tree data structures and identify algorithmic functions associated with them
Execute traversals and create graphs within a binary search tree structure
Describe strongly connected components in graphs
Skills you'll gain
Details to know

Add to your LinkedIn profile
16 assignments
See how employees at top companies are mastering in-demand skills

Build your subject-matter expertise
- Learn new concepts from industry experts
- Gain a foundational understanding of a subject or tool
- Develop job-relevant skills with hands-on projects
- Earn a shareable career certificate


Earn a career certificate
Add this credential to your LinkedIn profile, resume, or CV
Share it on social media and in your performance review

There are 4 modules in this course
In this module, you will learn about binary search trees and basic algorithms on binary search trees. We will also become familiar with the problem of balancing in binary search trees and study some solutions for balanced binary search trees such as Red-Black Trees.
What's included
5 videos11 readings5 assignments1 programming assignment1 discussion prompt
In this module, you will learn about graphs and various basic algorithms on graphs such as depth first/breadth first traversals, finding strongly connected components, and topological sorting.
What's included
7 videos6 readings4 assignments1 programming assignment
Union Find Data-structure with rank compression. Spanning trees and properties of spanning trees. Prim鈥檚 algorithm for finding minimal spanning trees. Kruskal鈥檚 algorithm for finding minimal spanning trees.
What's included
5 videos5 readings4 assignments1 programming assignment
In this module, you will learn about: Shortest Path Problem: Basics. Bellman-Ford Algorithm for single source shortest path. Dijkstra鈥檚 algorithm. Algorithms for all-pairs shortest path problem (Floyd-Warshall Algorithm)
What's included
6 videos6 readings3 assignments1 programming assignment
Instructor

Offered by
Why people choose 糖心vlog官网观看 for their career




Learner reviews
155 reviews
- 5 stars
76.12%
- 4 stars
16.12%
- 3 stars
4.51%
- 2 stars
1.29%
- 1 star
1.93%
Showing 3 of 155
Reviewed on Sep 29, 2022
T鈥媓is course is easy to understand and implement. It needs more programming exercises further!
Reviewed on Mar 30, 2022
I have grade 100%
Reviewed on Sep 13, 2024
Good but some typo's in the quizzes and assignments. Would like to see more thorough exercises
Explore more from Computer Science
University of Colorado Boulder
University of Colorado Boulder
University of California San Diego

Open new doors with 糖心vlog官网观看 Plus
Unlimited access to 10,000+ world-class courses, hands-on projects, and job-ready certificate programs - all included in your subscription
Advance your career with an online degree
Earn a degree from world-class universities - 100% online
Join over 3,400 global companies that choose 糖心vlog官网观看 for Business
Upskill your employees to excel in the digital economy