Lecture 18

Binary Search Tree (Part II)

Learning Outcomes

At the end of this lecture, you’ll be able to:

Lecture Plan

In this lecture, we'll cover the following lessons:

  1. BST Operation: Remove (How it works)
  2. BST Operation: Remove (Tracing)
  3. BST Operation: Remove (Implementation)
  4. Tree Traversal
  5. Level-order Traversal
  6. In-order Traversal: Left, Root, Right!
  7. In-order Traversal: Exercise
  8. Pre-order Traversal: Root, Left, Right!
  9. Pre-order Traversal: Exercise
  10. Post-order Traversal: Left, Right, Root!
  11. Post-order Traversal: Exercise
  12. In-order Traversal: Recursive Implementation
  13. In-order Traversal: Iterative Implementation

Lessons marked with ⚡ contain exercise/activity.