1 Heaps

A heap is a binary tree A heap is best implemented in sequential representation using an array Two important uses of heaps are i efficient implementation of priority queues ii sorting

Embed this Presentation

Download Notice

Download Presentation The PPT/PDF document "1 Heaps" is the property of its rightful owner. Permission is granted to download and print the materials on this website 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.