Binary Search Trees

Teaching Faculty Candidate Seminar

Zoom link for remote participants, passcode:  425109

Abstract: In this mock lecture, I will introduce the binary search tree data structure. We will look at operations on binary search trees and compare their efficiency to other data structures like sorted arrays. We will apply binary search trees to example applications. This lecture is aimed at students in their second computer science course (such as CS 2110) who have seen recursion, trees, and complexity.

Bio: Victoria Dean is a Ph.D. Candidate in the Robotics Institute at Carnegie Mellon University, a 2020 NSF Graduate Research Fellow, and a 2022 Siebel Scholar. She is passionate about teaching and mentoring undergraduate students, with an emphasis on improving diversity, equity, and inclusion. In research, she works on reinforcement learning and robotics and has advised several undergraduate researchers. Outside of computer science, she enjoys experimental baking, swing dancing, and knitting.