Binary Search Trees in JavaScript For Beginners

In this tutorial we are going to be going over a binary search tree. A binary search tree is a data structure which allows us to find data quickly. It is a tree like data structure with the following properties. 1) Every Node can at most have 2 children 2) Left Child must be less than its parent 3) Right Child must be greater than its parent 4) No Duplicates Within this video, we'll go over how to insert,delete,find,traverse and get the height of our binary search tree. Source Code: https://github.com/noobcoder1137/data... 0:00 intro 0:18 BST Properties 2:27 Downfalls of a BST 3:16 BST and Node Class Constructors 3:51 Insertion Overview 6:34 Insertion Code Overview 8:40 Insertion Code Example 13:28 Deletion Overview 16:58 Deletion Code Overview 20:00 findMin Code Overview 20:55 Deletion Code Example 25:03 Find Overview 27:12 Find Code Overview 29:06 Find Code Example 31:40 Traversals Overview 36:31 Traversals Code Overview 39:12 Traversals Code Example 46:02 BST Height Properties 46:41 BST Height Overview 47:47 BST Height Code Overview 49:41 BST Height Code Example