Intro
Binary Search Trees; If you Google the name, you'll see that they have a lot of nicknames such as BSTs, Ordered Binary Trees, Sorted Binary Trees, etc.
No matter what name we choose, we can all agree that a Binary Search Tree sounds like a super-complex computer science term that only programming Gods and math geniuses are able to understand!
But, just like a lot of other "scary" or complex-sounding programming and tech terms, Binary Search Trees are actually very interesting and not that hard to learn, implement and work with!
A Binary Search Tree (I'll call them BST(s) from here on) is a type of Binary Tree which itself is a type of Data Structure. Data Structures are ways of organizing and accessing data when we're working with computers and writing programs. If you've ever used a language like JavaScript, chances are, you've been using basic data structures without even realizing you are. Arrays and objects are two types of basic (and helpful!) data structures that you can find in almost any programming language.
In the upcoming article(s), I'll go over what BSTs are and how we can implement our own BST in JavaScript!
Whether you're an absolute beginner and this is the first time you're hearing about BSTs, a more experienced developer who just needs a reminder on BSTs or someone who's preparing for a technical interview, these articles are for you!
If you think more people can benefit from reading my series of posts on BST(s), share this post with your friends! I appreciate all of the support.
Stay tuned for the next post!
Top comments (0)