The Polymathic Engineer

The Polymathic Engineer

Binary Search Trees

What are binary search trees. Plus the most common BSTs implementations.

Franco Fernando's avatar
Franco Fernando
Aug 12, 2023
∙ Paid
8
1
Share

Hi Friends,

Welcome to the 35rd issue of the Polymathic Engineer newsletter. This week I want to focus on one of the most important data structures for a software engineer: binary search trees (BSTs).

The outline will be as follow:

  • what are binary search trees and what’s their strength

  • relevant balanced BSTs and their practical use cases

  • interesting tweets

Th…

This post is for paid subscribers

Already a paid subscriber? Sign in
© 2025 Franco Fernando
Privacy ∙ Terms ∙ Collection notice
Start writingGet the app
Substack is the home for great culture