| Previous Lecture | lect10 | Next Lecture |
Written notes
Go here and select the appropriate date: https://1drv.ms/o/s!AlgIeD1urAgmgQlHpyss6qfDD-Xm
Topics
- Binary search in sorted arrays
- Running times of 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
- Running time complexity for balanced BSTs