Code below… In this much-requested video we’ll take a look at the AVL tree data structure, which, at the most basic level, is simply a self-balancing Binary Search Tree. As always, in the first half of the video we’ll cover some background (including the main differences between an AVL and BST), and in the second half we’ll open up our coding editor and actually implement an AVL tree class using the Python coding language. (PYTHON 2) Code we start with (BST): https://github.com/bfaure/Python_Data_Structures/blob/master/Binary_Search_Tree/main.py Final Code (AVL): https://github.com/bfaure/Python_Data_Structures/blob/master/AVL_Tree/main.py (PYTHON 3) Code we start with (BST): https://github.com/bfaure/Python3_Data_Structures/blob/master/Binary_Search_Tree/main.py Final Code (AVL): https://github.com/bfaure/Python3_Data_Structures/blob/master/AVL_Tree/main.py **** Python Data Structures: https://tinyurl.com/y9yoh2x2 Python Algorithms: https://tinyurl.com/y8y4oks2 GUI development in Python (WIP): https://tinyurl.com/ybgnmwxf References: [1] https://en.wikipedia.org/wiki/AVL_tree [2] https://www.youtube.com/watch?v=FNeL18KsWPc [3] https://www.geeksforgeeks.org/avl-tree-set-1-insertion/ [4] https://www.geeksforgeeks.org/avl-tree-set-2-deletion/ [5] http://professor.ufabc.edu.br/~jesus.mena/courses/mc3305-2q-2015/AED2-10-avl-paper.pdf [6] http://www.mathcs.emory.edu/~cheung/Courses/323/Syllabus/Trees/AVL-delete.html End song is “Wonder Cycle” by Chris Zabriskie