Previous Lecture

lect16 Before Slides

lect16 Annotated Slides

Next Lecture

Code from lecture

This is the lecture post midterm 2.

Topics

• Binary trees
• Binary search trees (BST) - implementation
• Operations supported by a BST: Min, Max, Search, insert
• Pre-order, post-order and inorder traversal
• Worst case and average case running time of find on a BST