First Look at Binary Search Trees

Zoom link for remote attendees

Teaching Faculty Candidate Seminar

Abstract:  Binary trees and more specifically binary search trees, provide efficient solutions to many problems in computer science. This teaching demo will go through what binary trees are and how to write recursive functions to use them efficiently. This demonstration is aimed at students in the 2nd computer science course, EECS 280, after having seen binary search, recursion, and linked data structures (linked lists).

Bio: Jule Schatz is a 5th year computer science PhD student at the University of Michigan working with John E. Laird on cognitive modeling. During her time at Michigan Jule has helped teach multiple courses such as, EECS 183, EECS 280, EECS 492, and EECS 285. While teaching she has devoted time and energy to improving the climate and diversity of the department. Her efforts led her to winning multiple teaching and mentoring awards.