Part 9 Symmetric Mix-Max Heaps

1 / 17

# Part 9 Symmetric Mix-Max Heaps - PowerPoint PPT Presentation

Part 9 Symmetric Mix-Max Heaps. Return with min priority Return with max priority Insert arbitrary priority Delete min priority Delete max priority. Exercises. Page 469, Problem 2 Page 469, Problem 3 Page 469, Problem 4. SMMH. A complete binary tree Empty root

I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.

## Part 9 Symmetric Mix-Max Heaps

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.

- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript
1. Part 9Symmetric Mix-Max Heaps • Return with min priority • Return with max priority • Insert arbitrary priority • Delete min priority • Delete max priority

2. Exercises • Page 469, Problem 2 • Page 469, Problem 3 • Page 469, Problem 4

3. SMMH • A complete binary tree • Empty root • Min is the left child of root • Max is the right child of root • Left ≦ right sibling • LeftChild(grandparent) ≦ node • RightChild(grandparent) ≧ node

4. SMMH • Page 530, fig 9.25

5. Insertion • Page 533, fig 9.26

6. Insertion • Page 533, fig 9.27

7. Insertion • Page 534. fig 9.28

8. Insertion • Page 534, fig 9.29

9. Insertion • Page 535, fig 9.30

10. Insertion • Page 535, fig 9.31

11. Deletion • Page 538, fig 9.32

12. Deletion • Page 538, fig 9.33

13. Deletion • Page 539, fig 9.34

14. Deletion • Page 539, fig 9.35

15. Deletion • Page 540, fig 9.36

16. Deletion • Page 540, fig 9.37

17. Deletion • Page 541, fig 9.38