doing. template void BinaryHeap::insert(const Comparable & x) { if (isFull()) throw Overflow(); int hole = ++currentSize; // line 1 for ( ;hole > 1 && x < array[hole/2]; hole /= 2) // line 2 array[hole] = array[hole/2]; // line 3
Types of Linked List
A sequence of data elements connected through links is called a linked list (LL). The elements of a linked list are nodes containing data and a reference to the next node in the list. In a linked list, the elements are stored in a non-contiguous manner and the linear order in maintained by means of a pointer associated with each node in the list which is used to point to the subsequent node in the list.
Linked List
When a set of items is organized sequentially, it is termed as list. Linked list is a list whose order is given by links from one item to the next. It contains a link to the structure containing the next item so we can say that it is a completely different way to represent a list. In linked list, each structure of the list is known as node and it consists of two fields (one for containing the item and other one is for containing the next item address).
Please answer ASAP
The insert function below is used to insert item into the priority queue and maintaining the heap order property. (Note: isFull and Overflow functions are defined elsewhere and work properly)
Explain what are lines 1 to line 4 doing.
template void BinaryHeap::insert(const Comparable & x) { if (isFull()) throw Overflow(); int hole = ++currentSize;
// line 1
for ( ;hole > 1 && x < array[hole/2]; hole /= 2) // line 2
array[hole] = array[hole/2]; // line 3
array[hole] = x; // line 4 }
Step by step
Solved in 2 steps
