1 / 26

Figure 12.1 A binary search tree of a) maximum height; b) minimum height

Figure 12.1 A binary search tree of a) maximum height; b) minimum height. Figure 12.2 A 2-3 tree of height 3. Figure 12.3 Nodes in a 2-3 tree a) a 2-node; b) a 3-node. Figure 12.4 A 2-3 tree . Figure 12.5 a) A balanced binary search tree; b) a 2-3 tree with the same elements. Figure 12.6

aden
Download Presentation

Figure 12.1 A binary search tree of a) maximum height; b) minimum height

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. Figure 12.1 A binary search tree of a) maximum height; b) minimum height

  2. Figure 12.2 A 2-3 tree of height 3

  3. Figure 12.3 Nodes in a 2-3 tree a) a 2-node; b) a 3-node

  4. Figure 12.4 A 2-3 tree

  5. Figure 12.5 a) A balanced binary search tree; b) a 2-3 tree with the same elements

  6. Figure 12.6 a) The binary search tree of Figure 12.5a after a sequence of insertions; b) the 2-3 tree of Figure 12.5b after the same insertions

  7. Figure 12.7 After inserting 39

  8. Figure 12.8 a), b) The steps for inserting 38; c) the resulting tree

  9. Figure 12.9 After inserting 37

  10. Figure 12.10 a), b), c) The steps for inserting 36; d) the resulting tree

  11. Figure 12.11 The tree after the insertion of 35, 34, and 33

  12. Figure 12.12 Splitting a leaf in a 2-3 tree

  13. Figure 12.13 Splitting an internal node in a 2-3 tree

  14. Figure 12.14 Splitting the root of a 2-3 tree

  15. Figure 12.15a a), b), c), d) The steps for deleting 70

  16. Figure 12.15b-d a), b), c), d) The steps for deleting 70

  17. Figure 12.15e e) the resulting tree

  18. Figure 12.16 a), b), c) The steps for deleting 100; d) the resulting tree

  19. Figure 12.17a The steps for deleting 80

  20. Figure 12.17b and 12.17c The steps for deleting 80

  21. Figure 12.17d and 12.17e The steps for deleting 80

  22. Figure 12.18 Results of deleting 70, 100, and 80 from a) the binary search tree of Figure 12.5a and b) the 2-3 tree of Figure 12.5b

  23. Figure 12.19a and 12.19b a) Redistributing values; b) merging a leaf

  24. Figure 12.19c and 12.19d c) redistributing values and children; d) merging internal nodes

  25. Figure 12.19e e) deleting the root

More Related