Previous Lecture | lect11 Before Slides | lect11 Annotated Slides | Next Lecture |
Code written in class
https://github.com/ucsb-cs24-s18/cs24-s18-lectures/tree/master/lec-11
Topics
- Predecessor, successor and delete operations in a BST
- Traversing a BST inorder, preorder, post order
- Running time complexity for balanced BSTs