Skip to Main Content
Data Structures Using C, 2nd Edition by Pearson
book

Data Structures Using C, 2nd Edition by Pearson

by A. K. Sharma
May 2024
Intermediate to advanced content levelIntermediate to advanced
521 pages
14h 12m
English
Pearson India
Content preview from Data Structures Using C, 2nd Edition by Pearson
Trees 329
7.5.3.4 Heap Sort From discussion on heap trees, it is evident that the root of a maxHeap contains
the largest value. When the root of the max heap is deleted, we get the largest element of the heap.
The remaining elements are put to reheap operation and we get a new heap. If the two operations
delete and reheap operation is repeated till the heap becomes empty and the deleted elements stored
in the order of their removal, then we get a sorted list of elements in descending order as shown in
Figure 7.35.
Fig. 7.35 Repetitive deletion from a heap produces sorted list
22
70
31
45
56
delete
reHeap
36
59
70
60
62
69
68
22
70 69
31
45
36
56
69
60
62
59
68
22 ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Start your free trial

You might also like

Data Structures Using C

Data Structures Using C

Samir Kumar Bandyopadhyay, Kashi Nath Dey
Intermediate C Programming, 2nd Edition

Intermediate C Programming, 2nd Edition

Yung-Hsiang Lu, George K. Thiruvathukal

Publisher Resources

ISBN: 9781299831582