1 / 34

יסודות מבנה נתונים

יסודות מבנה נתונים. תרגול 6. AVL Trees. Trees. AVL Tree. Question 1. Insert 14, 17, 11, 7, 53, 4, 13 into an empty AVL tree. AVL Tree Example :. 14. 11. 17. 7. 53. 4. AVL Tree Example: Insert 14, 17, 11, 7, 53, 4, 13 into an empty AVL tree. 14. 7. 17. 4. 11. 53. 13.

yves
Download Presentation

יסודות מבנה נתונים

An Image/Link below is provided (as is) to download presentation 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. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Foundations of Data Structures - 2013/Spring, Amihai Savir & IlyaMirsky יסודות מבנה נתונים תרגול 6 AVL Trees

  2. Trees Foundations of Data Structures - 2013/Spring, Amihai Savir & Ilya Mirsky

  3. AVL Tree Foundations of Data Structures - 2013/Spring, Amihai Savir & IlyaMirsky

  4. Question 1 • Insert 14, 17, 11, 7, 53, 4, 13 into an empty AVL tree Foundations of Data Structures - 2013/Spring, Amihai Savir & Ilya Mirsky

  5. AVL Tree Example: 14 11 17 7 53 4

  6. AVL Tree Example: • Insert 14, 17, 11, 7, 53, 4, 13 into an empty AVL tree 14 7 17 4 11 53 13

  7. AVL Tree Example: • Now insert 12 14 7 17 4 11 53 13 12

  8. AVL Tree Example: • Now insert 12 14 7 17 4 11 53 12 13

  9. AVL Tree Example: • Now the AVL tree is balanced. 14 7 17 4 12 53 11 13

  10. AVL Tree Example: • Now insert 8 14 7 17 4 12 53 11 13 8

  11. AVL Tree Example: • Now insert 8 14 7 17 4 11 53 8 12 13

  12. AVL Tree Example: • Now the AVL tree is balanced. 14 11 17 7 12 53 4 8 13

  13. AVL Tree Example: • Now remove 53 14 11 17 7 12 53 4 8 13

  14. AVL Tree Example: • Now remove 53, unbalanced 14 11 17 7 12 4 8 13

  15. AVL Tree Example: • Balanced! Remove 11 11 7 14 4 8 12 17 13

  16. AVL Tree Example: • Remove 11, replace it with the largest in its left branch 8 7 14 4 12 17 13

  17. AVL Tree Example: • Remove 8, unbalanced 7 4 14 12 17 13

  18. AVL Tree Example: • Remove 8, unbalanced 7 4 12 14 13 17

  19. AVL Tree Example: • Balanced!! 12 7 14 4 13 17

  20. Question 2 Foundations of Data Structures - 2013/Spring, Amihai Savir & Ilya Mirsky

  21. Question 2 Foundations of Data Structures - 2013/Spring, Amihai Savir & Ilya Mirsky

  22. Question 2 Foundations of Data Structures - 2013/Spring, Amihai Savir & Ilya Mirsky

  23. Question 2 Foundations of Data Structures - 2013/Spring, Amihai Savir & Ilya Mirsky

  24. Question 3 Foundations of Data Structures - 2013/Spring, Amihai Savir & Ilya Mirsky

  25. Question 4 Foundations of Data Structures - 2013/Spring, Amihai Savir & Ilya Mirsky

  26. Question 4 Foundations of Data Structures - 2013/Spring, Amihai Savir & Ilya Mirsky

  27. Question 4 Foundations of Data Structures - 2013/Spring, Amihai Savir & Ilya Mirsky

  28. Question 4 Foundations of Data Structures - 2013/Spring, Amihai Savir & Ilya Mirsky

  29. Question 4 Foundations of Data Structures - 2013/Spring, Amihai Savir & Ilya Mirsky

  30. Question 5 Foundations of Data Structures - 2013/Spring, Amihai Savir & Ilya Mirsky

  31. Question 5 Foundations of Data Structures - 2013/Spring, Amihai Savir & Ilya Mirsky

  32. Question 5 Foundations of Data Structures - 2013/Spring, Amihai Savir & Ilya Mirsky

  33. Question 5 Foundations of Data Structures - 2013/Spring, Amihai Savir & Ilya Mirsky

  34. Question 5 Foundations of Data Structures - 2013/Spring, Amihai Savir & Ilya Mirsky

More Related