Trees and Graphs: Basics
Learn basic and advanced algorithms on tree and graph data structures, including binary search trees and self-balancing trees. Explore spatial data with kd-trees and gain expertise in spatial algorithms. Earn academic credit with CU Boulder’s Master of Science in Data Science (MS-DS) degree on Coursera. No application process, ideal for diverse backgrounds in computer science, information science, mathematics, and statistics. Discover more about the MS-DS program at https://www.coursera.org/degrees/master-of-science-data-science-boulder.
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.
User Reviews
Be the first to review “Trees and Graphs: Basics”
You must be logged in to post a review.
There are no reviews yet.