Lecture 17

Binary Search Tree (Part I)

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. Preface
  2. Binary Search: The Decision Tree
  3. Binary Search Tree: Is it a tree?
  4. Tree Components
  5. Binary Tree
  6. Binary Tree: A recursive structure
  7. Binary Search Tree
  8. Binary Search Tree: Node Class
  9. BST Operation: Find
  10. BST Operation: Insert (How it works)
  11. BST Operation: Insert (Tracing)
  12. BST Operation: Insert (Implementation)

Lessons marked with ⚡ contain exercise/activity.