| Previous Lecture | lect05 | Next Lecture |
lect05,
BST operations and Tree traversals
Code from lecture
https://github.com/ucsb-cs24-w26/cs24-w26-lectures/tree/main/lect05
Topics
- Coming up with algorithms by tracing through examples: BST insert
- Tree traversals: inorder, preorder, postorder, and why each is useful
- Outline of successor and delete operations
- Visualizing BST operations: https://visualgo.net/en/bst