Neural Lantern (@neurallantern)

AVL Trees: Adding Linear Data and Performing Rotations https://www.youtube.com/watch?v=6kasiB918fE Watch me build an AVL tree step by step with linear data that would normally create a terrible unbalanced BST. See insertions, balance factor calculations, and rotations in action. Perfect follow-up to my BST and AVL intro videos. 00:00 Introduction to AVL Tree with Bad Data 00:14 Previous Videos on BST and AVL Trees 00:28 Practice Example Building Step by Step 00:50 Adding First Node 12 01:11 Adding Node 21 02:10 Adding Node 30 and First Rotation 04:03 Recomputing Balance Factors 05:08 Adding Node 38 08:03 Adding Node 42 and Second Rotation 12:51 Recomputing Balance After Rotation 14:09 Adding Node 55 and Third Rotation 18:55 Placing Unaccounted Nodes 19:21 Final Tree and Balance Factors 20:07 Conclusion and Thanks =-=-=-=-=-=-=-=-= Thanks for watching! Find us on other social media here: - https://www.NeuralLantern.com/social - Twitter / X: https://x.com/NeuralLantern - Rumble: https://rumble.com/c/c-3696939 - BitChute: https://www.bitchute.com/channel/pg1Pvv5dN4Gt - Daily Motion: https://www.dailymotion.com/neurallantern - Minds: https://www.minds.com/neurallantern/ - Odysee: https://odysee.com/@NeuralLantern:5 Please show your support! - Buy me a coffee: https://ko-fi.com/neurallantern - Subscribe + Sharing on Social Media - Leave a comment or suggestion - Subscribe to the Blog: https://www.NeuralLantern.com - Watch the main "pinned" video of this channel for offers and extras AVL tree, AVL trees, binary search tree, self balancing tree, tree rotations, data structures tutorial, binary search tree insertion, AVL rotation example, computer science, programming tutorial, balance factor, BST, data structures