Previous Lecture

lect10 Before Slides

lect10 Annotated Slides

Next Lecture

Code written in class

https://github.com/ucsb-cs24-s18/cs24-s18-lectures/tree/master/lec-10

Topics

• Binary trees
• Binary search trees (BST) - implementation
• Operations supported by a BST: Min, Max, Search, Pre-decessor, Successor, Delete
• Worst case running time of find on a BST
• Running time of BST operations in terms of the height of the tree
• Balanced BSTs