Faculty Recruiting Support CICS

Binary Search Tree

13 Dec
Friday, 12/13/2019 10:00am to 11:00am
Computer Science Building, Room 142

Abstract: Binary search tree is an important topic in data structure course. In this lecture, I will focus on the binary search tree (BST) ADT as an abstraction, and implementation of the binary search tree ADT a referenced-based structure. Also, I will introduce common terminology for BST such as root, parent, child, level, height, etc., and binary search tree algorithms such as containssizeaddremove, and tree traversal algorithms (preorder, inorder, postorder). In the end of lecture, I will show how to analyze the time complexity of these binary search tree operations. 


Bio:  Meng-Chieh (Joe) Chiu is teaching fellow at University of Massachusetts (UMass) Amherst. He received his Doctorate degree from University of Massachusetts Amherst last September and started to teach undergraduate courses at UMass Amherst since then. The courses he taught includes Programming with Data Structure, Computer System Principle, and Programming Methodology.


Faculty Host