Binary Search Trees
What are binary search trees. Plus the most common BSTs implementations.
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