Understanding AVL Trees in Java - Live Webinar HD
◘ What are AVL Trees: • AVL Trees are self-balancing Binary Search Trees (BST) where the difference between heights of left and right subtrees cannot be more than one for all nodes. ◘ Need of AVL Trees: • BSTs have a property of organizing data in a way that the decisions to be taken at every node are binary. Due to this property, the search time in BSTs is O(log n). • However, BSTs cannot control the order in which data comes for insertion. Hence, BSTs sometimes become skewed leading to a height of n. AVL trees can re-arrange the data in the tree, hence reducing the searching time to O(log n). ◘ Topics to be Covered: • Basics of AVL • Rotations in AVL • Insertion, Searching in AVL ◘ Pre-requisites for the Webinar: • Basics of Trees • Basics of BSTs ◘ About the Java DS-Algo (Online) Course • All details about the online course are available on the Facebook event here: https://cb.lk/JavaOL/Fb and the course website here: https://cb.lk/JavaOL/Web • Use promo code HNY2018 to avail a discount of 18% off the course fees. ◘ About the Mentor • Garima Chhikara pursued her masters from IIIT-Delhi and joined us to pursue her passion for teaching. She has worked with DRDO and has interest and experience in technologies like Virtual Reality, Internet of Things, Software Defined Networking, Cloud Services, Information Retrieval and Data Mining • Rishab Kapoor is a graduate from Guru Nanak Dev University, Rishab has worked with Harman Connected Services as a software engineer. He is proficient with web development related technologies like HTML, CSS, Javascript along with Internet of Things development, OSGi framework, Spring and Hibernate.