Trees and Graphs: Basics

Fundamental algorithms on tree data structures, binary search trees, self-balancing trees, graph data structures, and basic graph traversal algorithms. This course also covers advanced topics such as k-d trees for spatial data and algorithms for spatial data. Trees and Graphs: Fundamentals can be taken for credit toward CU Boulder's Master of Science in Data Science (MS-DS) program, offered on Coursera. The MS-DS is an interdisciplinary degree with faculty from CU Boulder's Applied Mathematics, Computer Science, Information Science, and other departments. The MS-DS program, which is outcomes-based and requires no application, is ideal for individuals with a broad educational background and/or professional experience in computer science, computer science, mathematics, and statistics. Learn more about the MS-DS program at https://www.coursera.org/degrees/master-of-science-data-science-boulder.