Section 69 Heaps A particular kind of binary tree called a heap It has two properties The value of each node is greater max heap less min heap than or equal to the value stored in each of its children ID: 304558
Download Presentation The PPT/PDF document "Chapter 6" is the property of its rightful owner. Permission is granted to download and print the materials on this web site for personal, non-commercial use only, and to display it on your personal computer provided you do not modify the materials and that you retain all copyright notices contained in the materials. By downloading content from our website, you accept the terms of this agreement.
