Notes on Data Structure

The Tree is a recursive data structure containing the set of one or more data nodes where one node is designated as the root of the tree while the remaining nodes are called as the children of the root. The nodes other than the root node are partitioned into the nonempty sets where each one … Read more

Two queues are needed. One queue is used to store the data elements, and another is used for storing priorities. To implement a priority queue using queues, you would typically need at least two queues. One queue would hold the elements of the priority queue, and the other queue would be used temporarily for reordering … Read more

Dequeue (also known as double-ended queue) can be defined as an ordered set of elements in which the insertion and deletion can be performed at both the ends, i.e. front and rear. A dequeue, also known as a double-ended queue, is an abstract data type that supports insertion and deletion of elements from both the … Read more

If (rear + 1)%maxsize = front, the queue is full. In that case, overflow occurs and therefore, insertion can not be performed in the queue. If rear != max – 1, the rear will be incremented to the mod(maxsize) and the new value will be inserted at the rear end of the queue. If front … Read more

Memory Wastage: The space of the array, which is used to store queue elements, can never be reused to store the elements of that queue because the elements can only be inserted at front end and the value of front might be so high so that, all the space before that, can never be filled. … Read more