AVL Tree. Chapter 8 ( cont ’)Part3. Search Trees. Two standard search trees : Binary Search Trees (non-balanced ) All items in left sub-tree are less than root All items in right sub-tree are greater than or equal to the root Each sub-tree is a binary search tree AVL trees (balanced ).
Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.
Chapter 8 (cont’)Part3
23 18 12 20 44 35 52
12 20 18 35 52 44 23
12 18 20 23 35 44 52 (a sorted list!)
Left <pointer to Node>
right <pointer to Node>
bal <LH, EH, RH> // Balance factor
Text book, chapter 8: Binary Trees