AVL Trees Simply Explained

>> YOUR LINK HERE: ___ http://youtube.com/watch?v=JnrbMQyGLiU

In this part 2 tutorial of binary tree, binary search tree (a.k.a BST), we will see how you can delete a node from a binary search tree. We will look at 3 different cases where a node you are deleting is a leaf node, or it has only one child or it has two children. We can handle deletion in different ways in these cases. We will implement node deletion in python and in the end there will be an exercise that you can practice your skills on. • Exercise: https://github.com/codebasics/data-st... • Code of this video: https://github.com/codebasics/data-st... • Topics: • 00:00 Introduction • 00:21 Theory behind node deletion • 04:13 Python code for node deletion • 14:21 Exercise • #datastructures #algorithms #python • Do you want to learn technology from me? Check https://codebasics.io/ for my affordable video courses. • Next Video: • Graph Introduction - Data Structures ... • Previous video: • Binary Tree Part 1 | BST | Binary Sea... • Complete playlist: • Data Structures And Algorithms In Python • Website: https://codebasics.io/ • Facebook: / codebasicshub • Twitter: / codebasicshub

#############################

New on site