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
324 Data Structures Using C
}
}
}
void dispHeap (int heap[])
{
int i;
for (i = 1; i <= heap[0]; i++)
printf (“%d “, heap[i]);
}
e above program was tested for the input: 22 15 56 11 7 90 44
e output obtained is: 90 15 56 11 7 22 44, which is found to be correct.
In the next run, 89 was added to the list, i.e., 22 15 56 11 7 90 44 89.
We nd that the item ‘89’ has been inserted at proper place as indicated by the output obtained
thereof: 90 89 56 15 7 22 44 11
It is le as an exercise for the reader to verify above results.
7.5.3.3 Deletion of a Node from a Heap Tree The deletion operation on heap tree is relevant when
its root is deleted. ...
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