1 / 33

Chapter 9

Chapter 9. Heap. Objectives. Define and implement heap structures Understand the operation and use of the heap ADT. 9-1 Basic Concepts.

giza
Télécharger la présentation

Chapter 9

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. Chapter 9 Heap Objectives • Define and implement heap structures • Understand the operation and use of the heap ADT Data Structures: A Pseudocode Approach with C, Second Edition

  2. 9-1 Basic Concepts • A heap is a binary tree whose left and right subtrees have values less than their parents. The root of a heap is guaranteed to hold the largest node in the tree. • Both the left and the right branches of the tree have the same properties. • Heaps are often implemented in an array rather than a linked list. When arrays are used, we are able to calculate the location of the left and the right subtrees. Conversely, we can calculate the address of it’s parent. • The tree is complete or nearly complete. The key value of each node is greater than or equal to the key value in each of its descendents. This structure is also called max- heap. Data Structures: A Pseudocode Approach with C, Second Edition

  3. Data Structures: A Pseudocode Approach with C, Second Edition

  4. Data Structures: A Pseudocode Approach with C, Second Edition

  5. Maintenance Operations • Two basic maintenance operations are performed on a heap. • Insert a heap • Delete a heap • Two basic algorithms are – Reheap Up and Reheap Down Data Structures: A Pseudocode Approach with C, Second Edition

  6. The reheap up operation repairs the structure so that it is a heap by floating the last element up the tree until that element is in its correct location. • Insertion takes place at a leaf at the first empty position. This may create a situation where the new node’s key is larger than that of its parent. If it is, the node is floated up the tree by exchanging the child and parent keys and data. Data Structures: A Pseudocode Approach with C, Second Edition

  7. Data Structures: A Pseudocode Approach with C, Second Edition

  8. When we have a nearly complete binary tree that satisfies heap order property except in the root position. Reheap down operation reorders a broken heap by pushing the root down the tree until it is in correct position at the heap. Data Structures: A Pseudocode Approach with C, Second Edition

  9. Data Structures: A Pseudocode Approach with C, Second Edition

  10. 9-2 Heap Implementation • Heaps are usually implemented in an array structure. In this section we discuss and develop five heap algorithms. • Reheap Up • Reheap Down • Build a Heap • Insert a Node into a Heap • Delete a Node from a Heap Data Structures: A Pseudocode Approach with C, Second Edition

  11. Data Structures: A Pseudocode Approach with C, Second Edition

  12. Data Structures: A Pseudocode Approach with C, Second Edition

  13. Data Structures: A Pseudocode Approach with C, Second Edition

  14. (continued) Data Structures: A Pseudocode Approach with C, Second Edition

  15. Data Structures: A Pseudocode Approach with C, Second Edition

  16. Data Structures: A Pseudocode Approach with C, Second Edition

  17. Data Structures: A Pseudocode Approach with C, Second Edition

  18. Data Structures: A Pseudocode Approach with C, Second Edition

  19. Data Structures: A Pseudocode Approach with C, Second Edition

  20. Data Structures: A Pseudocode Approach with C, Second Edition

  21. 9-3 Heap ADT • We begin with a discussion of the heap ADT design and then develop the C code for the five major functions developed in Section 9.2. • Heap Structure • Heap Algorithms Data Structures: A Pseudocode Approach with C, Second Edition

  22. Data Structures: A Pseudocode Approach with C, Second Edition

  23. Data Structures: A Pseudocode Approach with C, Second Edition

  24. Data Structures: A Pseudocode Approach with C, Second Edition

  25. Data Structures: A Pseudocode Approach with C, Second Edition

  26. Data Structures: A Pseudocode Approach with C, Second Edition

  27. Data Structures: A Pseudocode Approach with C, Second Edition

  28. Data Structures: A Pseudocode Approach with C, Second Edition

  29. (continued) Data Structures: A Pseudocode Approach with C, Second Edition

  30. Data Structures: A Pseudocode Approach with C, Second Edition

  31. Data Structures: A Pseudocode Approach with C, Second Edition

  32. Data Structures: A Pseudocode Approach with C, Second Edition

  33. Data Structures: A Pseudocode Approach with C, Second Edition

More Related