1. Advanced Data Structure using C++

LECTURE NOTES OF ADVANCED DATA STRUCTURE (MT-CSE 110)
Figure shows two linked list in memory where each node of the both list are
stored in the same linear array INFO and LINK.
INFO LINK
The information part of a node may be recorded with more than one data item.
In such a case, the data should be stored in a collection of parallel arrays.
3. HEAP REPRESENTATION OF A PRIORITY QUEUES:
A heap is a complete binary tree and with the additional property‐ the root
element is either smallest or largest from its children if root element of the heap
is smallest from its children. It is known as min heap. If the root element of the
heap is largest from its children, it is known as max heap.
A priority queues can be resented using min or max heap.
A priority queues having highest priority for lower number can be represented
using min heap, and a priority queues having highest priority for higher number
can be represented using max heap.Hence, the element of the priority queues
to be processed next in the root node of the heap.If we compare the effort in
Prepared By :­
Er. Harvinder Singh
Assist Prof., CSE, H.C.T.M (Kaithal) Page ‐ 151 ‐