Binary Search Trees

Seminar | March 7 | 4-5 p.m. | 540 Cory Hall

Speaker/Performer:  Victoria Dean, Carnegie Mellon University

Sponsor:  Electrical Engineering and Computer Sciences (EECS)

An introduction to 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 who have seen recursion, trees, and complexity.

Event Contact:  CA, kcisco@berkeley.edu, 510-642-0954

Access Coordinator:  Katie Cisco,  kcisco@berkeley.edu,  510-642-0954