Binary Search Trees in Python 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...

Intro : 0:00
Binary Search Tree Rules : 00:20
Downfalls : 02:29
BST Init Methods : 03:15
Insertion Overview : 03:51
Insertion Code : 06:34
Insertion Code Example : 08:40
Deletion Overview : 13:28
Deletion Code: 16:58
Deletion Find Min Method Code : 19:59
Deletion Code Example : 20:57
Find Overview : 25:05
Find Code Example : 27:13
Find Code Example : 29:07
Traversals Overview : 31:40
Traversals Code: 36:32
Traversals Code Overview: 39:14
Height Overview : 46:02
Height Code : 47:48
Height Code Example : 49:42