Date: February 13th, 2017
Location: Carnegie Mellon University
Workshop Leader: DeeDee Han
In computer science, one of the most important topics of study is how to store data in a way that makes it easy to identify patterns and quickly find information. During this session, we’ll be diving into this subject by looking at “trees”, which are a particular type of data structure. Our activities will look under the hood at a few famous algorithms for searching for information in trees, and analyze how these algorithms perform in different situations. This workshop is held in partnership with CMU TechNights.