MISSION 231

Working with Binary Search Trees

This mission will teach you how to implement and query a data set using binary search trees (BST).

Objectives

  • How to build and run a BST.
  • Determine when to use a binary search tree over a heap.
  • Discover the runtime of binary search tree algorithms.

Mission Outline

1. Introduction to the BST
2. Insert Multiple and Sorted Order
3. Searching the BST
4. Why We Need a Balanced BST
5. Maintaining a Balance (Part 1)
6. Maintaining a Balance (Part 2)
7. Maintaining a Balance (Part 3)
8. Enhancing the Node and BST Class
9. Adding the Range Query
10. Range Querying a CSV
11. Next Steps
12. Takeaways

recursion-and-tree-structures

Course Info:

Recursion and Trees

Advanced

The median completion time for this course is 5.2 hours.

This course requires a premium subscription. This course includes six missions and one guided project.  It is the sixth course in the Data Engineer path.

START LEARNING FREE

Take a Look Inside

START LEARNING FREE