More on BSTs

Competitions

Binary search trees have unique properties, but they’re not that useful when you want to use them to speed up certain operations, because they can get skewed based on the input and order of construction.

For that reason, you will not find yourself coding BSTs in competitions, but self-balancing BSTs are used to solve this problem.

Balancing BSTs

Self-Balancing BSTs maintain their height by rotating skewed subtrees. Balancing BSTs are powerful structures that we will be using very often. We’ll cover this at later levels.

---

We’ll conclude this course with the next lesson.